/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:08:46,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:08:46,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:08:46,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:08:46,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:08:46,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:08:46,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:08:46,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:08:46,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:08:46,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:08:46,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:08:46,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:08:46,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:08:46,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:08:46,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:08:46,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:08:46,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:08:46,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:08:46,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:08:46,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:08:46,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:08:46,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:08:46,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:08:46,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:08:46,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:08:46,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:08:46,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:08:46,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:08:46,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:08:46,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:08:46,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:08:46,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:08:46,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:08:46,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:08:46,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:08:46,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:08:46,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:08:46,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:08:46,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:08:46,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:08:46,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:08:46,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 20:08:46,845 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:08:46,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:08:46,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:08:46,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:08:46,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:08:46,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:08:46,847 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:08:46,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:08:46,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:08:46,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:08:46,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:08:46,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:08:46,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:08:46,848 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:08:46,849 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:08:46,849 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:08:46,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:08:46,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:08:46,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:08:46,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:08:46,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:08:46,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:46,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:08:46,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:08:46,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:08:46,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:08:46,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:08:46,850 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:08:46,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:08:46,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:08:46,850 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:08:46,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:08:46,851 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:08:46,852 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:08:47,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:08:47,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:08:47,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:08:47,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:08:47,052 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:08:47,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1a.c [2022-01-10 20:08:47,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9dd1017a/1eb52e076c30495a94566f5b2e1f8aaa/FLAG3d7263cc7 [2022-01-10 20:08:47,502 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:08:47,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1a.c [2022-01-10 20:08:47,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9dd1017a/1eb52e076c30495a94566f5b2e1f8aaa/FLAG3d7263cc7 [2022-01-10 20:08:47,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9dd1017a/1eb52e076c30495a94566f5b2e1f8aaa [2022-01-10 20:08:47,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:08:47,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:08:47,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:47,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:08:47,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:08:47,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:47" (1/1) ... [2022-01-10 20:08:47,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c81c8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:47, skipping insertion in model container [2022-01-10 20:08:47,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:47" (1/1) ... [2022-01-10 20:08:47,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:08:47,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:08:48,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2022-01-10 20:08:48,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:48,129 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:08:48,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2022-01-10 20:08:48,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:48,185 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:08:48,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48 WrapperNode [2022-01-10 20:08:48,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:48,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:48,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:08:48,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:08:48,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,219 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 440 [2022-01-10 20:08:48,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:48,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:08:48,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:08:48,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:08:48,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:08:48,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:08:48,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:08:48,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:08:48,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:48,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:08:48,266 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 20:08:48,283 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 20:08:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:08:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:08:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:08:48,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:08:48,366 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:08:48,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:08:48,376 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 20:08:48,693 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-01-10 20:08:48,693 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-01-10 20:08:48,693 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:08:48,698 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:08:48,699 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 20:08:48,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:48 BoogieIcfgContainer [2022-01-10 20:08:48,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:08:48,701 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:08:48,701 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:08:48,702 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:08:48,704 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:48" (1/1) ... [2022-01-10 20:08:48,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:48 BasicIcfg [2022-01-10 20:08:48,831 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:08:48,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:08:48,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:08:48,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:08:48,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:08:47" (1/4) ... [2022-01-10 20:08:48,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52855203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:48, skipping insertion in model container [2022-01-10 20:08:48,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:48" (2/4) ... [2022-01-10 20:08:48,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52855203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:48, skipping insertion in model container [2022-01-10 20:08:48,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:48" (3/4) ... [2022-01-10 20:08:48,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52855203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:08:48, skipping insertion in model container [2022-01-10 20:08:48,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:48" (4/4) ... [2022-01-10 20:08:48,836 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.cTransformedIcfg [2022-01-10 20:08:48,840 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:08:48,840 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 20:08:48,873 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:08:48,878 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 20:08:48,878 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 20:08:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 20:08:48,895 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:48,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:48,896 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:48,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1936049821, now seen corresponding path program 1 times [2022-01-10 20:08:48,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:48,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521870911] [2022-01-10 20:08:48,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:48,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:49,107 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 20:08:49,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:49,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521870911] [2022-01-10 20:08:49,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521870911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:49,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:49,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:49,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844018003] [2022-01-10 20:08:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:49,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:49,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:49,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:49,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:49,145 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 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.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 20:08:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:51,431 INFO L93 Difference]: Finished difference Result 247 states and 423 transitions. [2022-01-10 20:08:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:51,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 20:08:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:51,440 INFO L225 Difference]: With dead ends: 247 [2022-01-10 20:08:51,440 INFO L226 Difference]: Without dead ends: 113 [2022-01-10 20:08:51,443 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 20:08:51,451 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:51,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 320 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 20:08:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-10 20:08:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-01-10 20:08:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 112 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2022-01-10 20:08:51,496 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 25 [2022-01-10 20:08:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:51,497 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2022-01-10 20:08:51,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2022-01-10 20:08:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 20:08:51,499 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:51,499 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:51,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:08:51,500 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash 331205567, now seen corresponding path program 1 times [2022-01-10 20:08:51,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:51,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064176440] [2022-01-10 20:08:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:51,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:51,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:51,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064176440] [2022-01-10 20:08:51,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064176440] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:51,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:51,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:51,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079144473] [2022-01-10 20:08:51,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:51,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:51,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:51,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:51,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:51,617 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:51,640 INFO L93 Difference]: Finished difference Result 323 states and 489 transitions. [2022-01-10 20:08:51,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:51,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-10 20:08:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:51,641 INFO L225 Difference]: With dead ends: 323 [2022-01-10 20:08:51,642 INFO L226 Difference]: Without dead ends: 221 [2022-01-10 20:08:51,642 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 20:08:51,643 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 152 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:51,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 325 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-01-10 20:08:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2022-01-10 20:08:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.518348623853211) internal successors, (331), 218 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 331 transitions. [2022-01-10 20:08:51,656 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 331 transitions. Word has length 37 [2022-01-10 20:08:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:51,656 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 331 transitions. [2022-01-10 20:08:51,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 331 transitions. [2022-01-10 20:08:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 20:08:51,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:51,657 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:51,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:08:51,658 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash 300185760, now seen corresponding path program 1 times [2022-01-10 20:08:51,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:51,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640846061] [2022-01-10 20:08:51,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:51,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:51,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:51,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640846061] [2022-01-10 20:08:51,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640846061] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:51,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:51,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:51,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577307929] [2022-01-10 20:08:51,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:51,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:51,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:51,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:51,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:51,737 INFO L87 Difference]: Start difference. First operand 219 states and 331 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:51,929 INFO L93 Difference]: Finished difference Result 455 states and 693 transitions. [2022-01-10 20:08:51,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:51,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-10 20:08:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:51,931 INFO L225 Difference]: With dead ends: 455 [2022-01-10 20:08:51,931 INFO L226 Difference]: Without dead ends: 254 [2022-01-10 20:08:51,932 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 20:08:51,933 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:51,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 241 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:08:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-01-10 20:08:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2022-01-10 20:08:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.4898785425101215) internal successors, (368), 247 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 368 transitions. [2022-01-10 20:08:51,964 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 368 transitions. Word has length 37 [2022-01-10 20:08:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:51,964 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 368 transitions. [2022-01-10 20:08:51,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 368 transitions. [2022-01-10 20:08:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 20:08:51,966 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:51,966 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2022-01-10 20:08:51,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:08:51,966 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:51,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash -405908997, now seen corresponding path program 1 times [2022-01-10 20:08:51,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:51,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012845176] [2022-01-10 20:08:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:51,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 20:08:52,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:52,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012845176] [2022-01-10 20:08:52,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012845176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:52,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:52,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:52,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035213008] [2022-01-10 20:08:52,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:52,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:52,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:52,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:52,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:52,070 INFO L87 Difference]: Start difference. First operand 248 states and 368 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:54,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 20:08:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:54,284 INFO L93 Difference]: Finished difference Result 519 states and 779 transitions. [2022-01-10 20:08:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2022-01-10 20:08:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:54,286 INFO L225 Difference]: With dead ends: 519 [2022-01-10 20:08:54,286 INFO L226 Difference]: Without dead ends: 289 [2022-01-10 20:08:54,287 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 20:08:54,288 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:54,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 254 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 20:08:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-01-10 20:08:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 281. [2022-01-10 20:08:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.4607142857142856) internal successors, (409), 280 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 409 transitions. [2022-01-10 20:08:54,304 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 409 transitions. Word has length 51 [2022-01-10 20:08:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:54,304 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 409 transitions. [2022-01-10 20:08:54,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2022-01-10 20:08:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 20:08:54,306 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:54,306 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 20:08:54,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:08:54,307 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash -363810228, now seen corresponding path program 1 times [2022-01-10 20:08:54,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:54,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082898062] [2022-01-10 20:08:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:54,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:54,386 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 20:08:54,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:54,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082898062] [2022-01-10 20:08:54,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082898062] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:54,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:54,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:54,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487004463] [2022-01-10 20:08:54,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:54,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:54,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:54,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:54,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:54,396 INFO L87 Difference]: Start difference. First operand 281 states and 409 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 20:08:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:54,431 INFO L93 Difference]: Finished difference Result 805 states and 1174 transitions. [2022-01-10 20:08:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:54,432 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 20:08:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:54,435 INFO L225 Difference]: With dead ends: 805 [2022-01-10 20:08:54,435 INFO L226 Difference]: Without dead ends: 542 [2022-01-10 20:08:54,435 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 20:08:54,438 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 137 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 304 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 20:08:54,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 304 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-01-10 20:08:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2022-01-10 20:08:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4510166358595193) internal successors, (785), 541 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 785 transitions. [2022-01-10 20:08:54,464 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 785 transitions. Word has length 68 [2022-01-10 20:08:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:54,468 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 785 transitions. [2022-01-10 20:08:54,468 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 20:08:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 785 transitions. [2022-01-10 20:08:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-10 20:08:54,475 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:54,476 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, 1] [2022-01-10 20:08:54,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:08:54,476 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash -779208509, now seen corresponding path program 1 times [2022-01-10 20:08:54,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:54,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634631169] [2022-01-10 20:08:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:54,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:54,561 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 20:08:54,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:54,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634631169] [2022-01-10 20:08:54,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634631169] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:54,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:54,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:54,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581470471] [2022-01-10 20:08:54,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:54,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:54,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:54,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:54,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:54,564 INFO L87 Difference]: Start difference. First operand 542 states and 785 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:56,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 20:08:58,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 20:08:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:58,878 INFO L93 Difference]: Finished difference Result 1160 states and 1704 transitions. [2022-01-10 20:08:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:58,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 86 [2022-01-10 20:08:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:58,882 INFO L225 Difference]: With dead ends: 1160 [2022-01-10 20:08:58,882 INFO L226 Difference]: Without dead ends: 636 [2022-01-10 20:08:58,883 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 20:08:58,886 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 12 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:58,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 259 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-01-10 20:08:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-01-10 20:08:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 624. [2022-01-10 20:08:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 1.4173354735152488) internal successors, (883), 623 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 883 transitions. [2022-01-10 20:08:58,901 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 883 transitions. Word has length 86 [2022-01-10 20:08:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:58,902 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 883 transitions. [2022-01-10 20:08:58,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 883 transitions. [2022-01-10 20:08:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 20:08:58,903 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:58,903 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] [2022-01-10 20:08:58,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:08:58,904 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:58,904 INFO L85 PathProgramCache]: Analyzing trace with hash -84621112, now seen corresponding path program 1 times [2022-01-10 20:08:58,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:58,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72074143] [2022-01-10 20:08:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:58,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:58,962 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 20:08:58,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:58,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72074143] [2022-01-10 20:08:58,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72074143] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:58,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:58,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:58,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166510627] [2022-01-10 20:08:58,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:58,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:58,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:58,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:58,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:58,965 INFO L87 Difference]: Start difference. First operand 624 states and 883 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:59,002 INFO L93 Difference]: Finished difference Result 928 states and 1315 transitions. [2022-01-10 20:08:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:59,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-10 20:08:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:59,006 INFO L225 Difference]: With dead ends: 928 [2022-01-10 20:08:59,006 INFO L226 Difference]: Without dead ends: 926 [2022-01-10 20:08:59,006 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 20:08:59,007 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 138 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 301 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 20:08:59,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 301 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-01-10 20:08:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2022-01-10 20:08:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 1.4183783783783783) internal successors, (1312), 925 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1312 transitions. [2022-01-10 20:08:59,025 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1312 transitions. Word has length 106 [2022-01-10 20:08:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:59,026 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1312 transitions. [2022-01-10 20:08:59,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1312 transitions. [2022-01-10 20:08:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-10 20:08:59,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:59,031 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 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] [2022-01-10 20:08:59,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:08:59,032 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:59,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2018281064, now seen corresponding path program 1 times [2022-01-10 20:08:59,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:59,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048575612] [2022-01-10 20:08:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:59,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-10 20:08:59,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:59,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048575612] [2022-01-10 20:08:59,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048575612] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:59,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:59,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:59,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169726782] [2022-01-10 20:08:59,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:59,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:59,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:59,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:59,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:59,088 INFO L87 Difference]: Start difference. First operand 926 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:59,285 INFO L93 Difference]: Finished difference Result 2131 states and 3114 transitions. [2022-01-10 20:08:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 124 [2022-01-10 20:08:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:59,293 INFO L225 Difference]: With dead ends: 2131 [2022-01-10 20:08:59,295 INFO L226 Difference]: Without dead ends: 1217 [2022-01-10 20:08:59,297 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 20:08:59,298 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 75 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:59,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 234 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:08:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2022-01-10 20:08:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1169. [2022-01-10 20:08:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1168 states have (on average 1.4546232876712328) internal successors, (1699), 1168 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1699 transitions. [2022-01-10 20:08:59,317 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1699 transitions. Word has length 124 [2022-01-10 20:08:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:59,318 INFO L470 AbstractCegarLoop]: Abstraction has 1169 states and 1699 transitions. [2022-01-10 20:08:59,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1699 transitions. [2022-01-10 20:08:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-10 20:08:59,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:59,320 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 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, 1, 1, 1, 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 20:08:59,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:08:59,320 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:59,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1720196821, now seen corresponding path program 1 times [2022-01-10 20:08:59,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:59,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067568521] [2022-01-10 20:08:59,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:59,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 20:08:59,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:59,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067568521] [2022-01-10 20:08:59,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067568521] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:59,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:59,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:59,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424015578] [2022-01-10 20:08:59,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:59,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:59,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:59,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:59,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:59,378 INFO L87 Difference]: Start difference. First operand 1169 states and 1699 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:59,531 INFO L93 Difference]: Finished difference Result 2868 states and 4284 transitions. [2022-01-10 20:08:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2022-01-10 20:08:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:59,537 INFO L225 Difference]: With dead ends: 2868 [2022-01-10 20:08:59,537 INFO L226 Difference]: Without dead ends: 1615 [2022-01-10 20:08:59,539 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 20:08:59,540 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 81 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:59,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 213 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2022-01-10 20:08:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1541. [2022-01-10 20:08:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.4188311688311688) internal successors, (2185), 1540 states have internal predecessors, (2185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2185 transitions. [2022-01-10 20:08:59,567 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2185 transitions. Word has length 150 [2022-01-10 20:08:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:59,567 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2185 transitions. [2022-01-10 20:08:59,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2185 transitions. [2022-01-10 20:08:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-10 20:08:59,570 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:59,570 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 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, 1, 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 20:08:59,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:08:59,570 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1646780735, now seen corresponding path program 1 times [2022-01-10 20:08:59,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:59,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543299141] [2022-01-10 20:08:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:59,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-01-10 20:08:59,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:59,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543299141] [2022-01-10 20:08:59,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543299141] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:59,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:59,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:59,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597038135] [2022-01-10 20:08:59,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:59,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:59,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:59,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:59,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:59,648 INFO L87 Difference]: Start difference. First operand 1541 states and 2185 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:59,811 INFO L93 Difference]: Finished difference Result 3373 states and 4812 transitions. [2022-01-10 20:08:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:59,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2022-01-10 20:08:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:59,816 INFO L225 Difference]: With dead ends: 3373 [2022-01-10 20:08:59,816 INFO L226 Difference]: Without dead ends: 1760 [2022-01-10 20:08:59,819 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 20:08:59,819 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 84 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:59,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 209 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-01-10 20:08:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1688. [2022-01-10 20:08:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1688 states, 1687 states have (on average 1.4036751630112625) internal successors, (2368), 1687 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2368 transitions. [2022-01-10 20:08:59,872 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2368 transitions. Word has length 171 [2022-01-10 20:08:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:59,872 INFO L470 AbstractCegarLoop]: Abstraction has 1688 states and 2368 transitions. [2022-01-10 20:08:59,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2368 transitions. [2022-01-10 20:08:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-01-10 20:08:59,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:59,875 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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] [2022-01-10 20:08:59,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:08:59,875 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:59,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash -262260135, now seen corresponding path program 1 times [2022-01-10 20:08:59,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:59,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276504504] [2022-01-10 20:08:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:59,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-01-10 20:08:59,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:59,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276504504] [2022-01-10 20:08:59,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276504504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:59,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:59,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:59,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739531272] [2022-01-10 20:08:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:59,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:59,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:59,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:59,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:59,942 INFO L87 Difference]: Start difference. First operand 1688 states and 2368 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:00,100 INFO L93 Difference]: Finished difference Result 3667 states and 5172 transitions. [2022-01-10 20:09:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:00,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2022-01-10 20:09:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:00,105 INFO L225 Difference]: With dead ends: 3667 [2022-01-10 20:09:00,106 INFO L226 Difference]: Without dead ends: 1919 [2022-01-10 20:09:00,108 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 20:09:00,108 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 85 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:00,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 207 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2022-01-10 20:09:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1853. [2022-01-10 20:09:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.3936285097192225) internal successors, (2581), 1852 states have internal predecessors, (2581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2581 transitions. [2022-01-10 20:09:00,141 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2581 transitions. Word has length 195 [2022-01-10 20:09:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:00,141 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2581 transitions. [2022-01-10 20:09:00,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2581 transitions. [2022-01-10 20:09:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-01-10 20:09:00,144 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:00,144 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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] [2022-01-10 20:09:00,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:09:00,144 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:00,145 INFO L85 PathProgramCache]: Analyzing trace with hash -870336998, now seen corresponding path program 1 times [2022-01-10 20:09:00,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:00,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782975086] [2022-01-10 20:09:00,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:00,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-01-10 20:09:00,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:00,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782975086] [2022-01-10 20:09:00,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782975086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:00,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:00,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:00,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005877001] [2022-01-10 20:09:00,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:00,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:00,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:00,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:00,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:00,210 INFO L87 Difference]: Start difference. First operand 1853 states and 2581 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:00,372 INFO L93 Difference]: Finished difference Result 3997 states and 5604 transitions. [2022-01-10 20:09:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:00,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2022-01-10 20:09:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:00,378 INFO L225 Difference]: With dead ends: 3997 [2022-01-10 20:09:00,378 INFO L226 Difference]: Without dead ends: 2108 [2022-01-10 20:09:00,380 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 20:09:00,381 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 87 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:00,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 205 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2022-01-10 20:09:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2036. [2022-01-10 20:09:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 2035 states have (on average 1.3936117936117935) internal successors, (2836), 2035 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2836 transitions. [2022-01-10 20:09:00,447 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2836 transitions. Word has length 195 [2022-01-10 20:09:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:00,447 INFO L470 AbstractCegarLoop]: Abstraction has 2036 states and 2836 transitions. [2022-01-10 20:09:00,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2836 transitions. [2022-01-10 20:09:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-01-10 20:09:00,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:00,450 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2022-01-10 20:09:00,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:09:00,450 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:00,451 INFO L85 PathProgramCache]: Analyzing trace with hash -558650775, now seen corresponding path program 1 times [2022-01-10 20:09:00,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:00,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764288978] [2022-01-10 20:09:00,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:00,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-01-10 20:09:00,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:00,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764288978] [2022-01-10 20:09:00,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764288978] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:00,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:00,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:00,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617305651] [2022-01-10 20:09:00,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:00,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:00,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:00,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:00,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:00,514 INFO L87 Difference]: Start difference. First operand 2036 states and 2836 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:00,564 INFO L93 Difference]: Finished difference Result 5901 states and 8237 transitions. [2022-01-10 20:09:00,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:00,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 225 [2022-01-10 20:09:00,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:00,575 INFO L225 Difference]: With dead ends: 5901 [2022-01-10 20:09:00,575 INFO L226 Difference]: Without dead ends: 3883 [2022-01-10 20:09:00,578 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 20:09:00,580 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 123 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 479 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 20:09:00,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 479 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2022-01-10 20:09:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3881. [2022-01-10 20:09:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3881 states, 3880 states have (on average 1.395360824742268) internal successors, (5414), 3880 states have internal predecessors, (5414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 5414 transitions. [2022-01-10 20:09:00,659 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 5414 transitions. Word has length 225 [2022-01-10 20:09:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:00,660 INFO L470 AbstractCegarLoop]: Abstraction has 3881 states and 5414 transitions. [2022-01-10 20:09:00,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 5414 transitions. [2022-01-10 20:09:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-01-10 20:09:00,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:00,664 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2022-01-10 20:09:00,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:09:00,664 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1166727638, now seen corresponding path program 1 times [2022-01-10 20:09:00,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:00,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415094583] [2022-01-10 20:09:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:00,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-01-10 20:09:00,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:00,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415094583] [2022-01-10 20:09:00,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415094583] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:00,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:00,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:00,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874825880] [2022-01-10 20:09:00,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:00,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:00,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:00,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:00,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:00,723 INFO L87 Difference]: Start difference. First operand 3881 states and 5414 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:00,932 INFO L93 Difference]: Finished difference Result 8350 states and 11714 transitions. [2022-01-10 20:09:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:00,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 225 [2022-01-10 20:09:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:00,944 INFO L225 Difference]: With dead ends: 8350 [2022-01-10 20:09:00,944 INFO L226 Difference]: Without dead ends: 4427 [2022-01-10 20:09:00,949 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 20:09:00,950 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 90 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:00,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 199 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2022-01-10 20:09:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 4295. [2022-01-10 20:09:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4295 states, 4294 states have (on average 1.4019562179785747) internal successors, (6020), 4294 states have internal predecessors, (6020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 6020 transitions. [2022-01-10 20:09:01,037 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 6020 transitions. Word has length 225 [2022-01-10 20:09:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:01,037 INFO L470 AbstractCegarLoop]: Abstraction has 4295 states and 6020 transitions. [2022-01-10 20:09:01,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 6020 transitions. [2022-01-10 20:09:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-01-10 20:09:01,044 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:01,044 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:01,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:09:01,044 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1867605170, now seen corresponding path program 1 times [2022-01-10 20:09:01,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:01,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243050027] [2022-01-10 20:09:01,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:01,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2022-01-10 20:09:01,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:01,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243050027] [2022-01-10 20:09:01,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243050027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:01,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:01,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:01,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149265890] [2022-01-10 20:09:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:01,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:01,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:01,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:01,109 INFO L87 Difference]: Start difference. First operand 4295 states and 6020 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:01,299 INFO L93 Difference]: Finished difference Result 8704 states and 12164 transitions. [2022-01-10 20:09:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:01,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2022-01-10 20:09:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:01,311 INFO L225 Difference]: With dead ends: 8704 [2022-01-10 20:09:01,311 INFO L226 Difference]: Without dead ends: 4391 [2022-01-10 20:09:01,317 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 20:09:01,318 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 93 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:01,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 194 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4391 states. [2022-01-10 20:09:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4391 to 4259. [2022-01-10 20:09:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 4258 states have (on average 1.3884452794739315) internal successors, (5912), 4258 states have internal predecessors, (5912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 5912 transitions. [2022-01-10 20:09:01,420 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 5912 transitions. Word has length 260 [2022-01-10 20:09:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:01,421 INFO L470 AbstractCegarLoop]: Abstraction has 4259 states and 5912 transitions. [2022-01-10 20:09:01,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 5912 transitions. [2022-01-10 20:09:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-01-10 20:09:01,426 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:01,426 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:01,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:09:01,426 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash -912233712, now seen corresponding path program 1 times [2022-01-10 20:09:01,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:01,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405553645] [2022-01-10 20:09:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:01,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-01-10 20:09:01,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:01,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405553645] [2022-01-10 20:09:01,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405553645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:01,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:01,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:01,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115466493] [2022-01-10 20:09:01,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:01,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:01,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:01,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:01,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:01,530 INFO L87 Difference]: Start difference. First operand 4259 states and 5912 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:01,605 INFO L93 Difference]: Finished difference Result 12711 states and 17642 transitions. [2022-01-10 20:09:01,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:01,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 270 [2022-01-10 20:09:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:01,633 INFO L225 Difference]: With dead ends: 12711 [2022-01-10 20:09:01,633 INFO L226 Difference]: Without dead ends: 8470 [2022-01-10 20:09:01,640 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 20:09:01,640 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 69 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:01,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 324 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8470 states. [2022-01-10 20:09:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8470 to 8468. [2022-01-10 20:09:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8468 states, 8467 states have (on average 1.384079366954057) internal successors, (11719), 8467 states have internal predecessors, (11719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8468 states to 8468 states and 11719 transitions. [2022-01-10 20:09:01,812 INFO L78 Accepts]: Start accepts. Automaton has 8468 states and 11719 transitions. Word has length 270 [2022-01-10 20:09:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:01,812 INFO L470 AbstractCegarLoop]: Abstraction has 8468 states and 11719 transitions. [2022-01-10 20:09:01,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 8468 states and 11719 transitions. [2022-01-10 20:09:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-01-10 20:09:01,822 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:01,822 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:01,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:09:01,822 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:01,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash -960963054, now seen corresponding path program 1 times [2022-01-10 20:09:01,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:01,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259401695] [2022-01-10 20:09:01,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:01,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 20:09:01,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:01,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259401695] [2022-01-10 20:09:01,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259401695] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:01,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:01,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:01,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265993078] [2022-01-10 20:09:01,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:01,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:01,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:01,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:01,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:01,894 INFO L87 Difference]: Start difference. First operand 8468 states and 11719 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:02,121 INFO L93 Difference]: Finished difference Result 17128 states and 23658 transitions. [2022-01-10 20:09:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:02,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 270 [2022-01-10 20:09:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:02,134 INFO L225 Difference]: With dead ends: 17128 [2022-01-10 20:09:02,135 INFO L226 Difference]: Without dead ends: 8684 [2022-01-10 20:09:02,141 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 20:09:02,142 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:02,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 253 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8684 states. [2022-01-10 20:09:02,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8684 to 8468. [2022-01-10 20:09:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8468 states, 8467 states have (on average 1.3585685602929019) internal successors, (11503), 8467 states have internal predecessors, (11503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8468 states to 8468 states and 11503 transitions. [2022-01-10 20:09:02,278 INFO L78 Accepts]: Start accepts. Automaton has 8468 states and 11503 transitions. Word has length 270 [2022-01-10 20:09:02,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:02,279 INFO L470 AbstractCegarLoop]: Abstraction has 8468 states and 11503 transitions. [2022-01-10 20:09:02,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,279 INFO L276 IsEmpty]: Start isEmpty. Operand 8468 states and 11503 transitions. [2022-01-10 20:09:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-01-10 20:09:02,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:02,288 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:02,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:09:02,289 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:02,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash -861816222, now seen corresponding path program 1 times [2022-01-10 20:09:02,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:02,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434355777] [2022-01-10 20:09:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:02,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-01-10 20:09:02,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:02,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434355777] [2022-01-10 20:09:02,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434355777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:02,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:02,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:02,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312302878] [2022-01-10 20:09:02,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:02,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:02,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:02,360 INFO L87 Difference]: Start difference. First operand 8468 states and 11503 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:02,602 INFO L93 Difference]: Finished difference Result 18088 states and 24330 transitions. [2022-01-10 20:09:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:02,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 297 [2022-01-10 20:09:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:02,616 INFO L225 Difference]: With dead ends: 18088 [2022-01-10 20:09:02,616 INFO L226 Difference]: Without dead ends: 9644 [2022-01-10 20:09:02,625 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 20:09:02,625 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 106 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:02,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 189 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2022-01-10 20:09:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 8804. [2022-01-10 20:09:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8804 states, 8803 states have (on average 1.355787799613768) internal successors, (11935), 8803 states have internal predecessors, (11935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8804 states to 8804 states and 11935 transitions. [2022-01-10 20:09:02,827 INFO L78 Accepts]: Start accepts. Automaton has 8804 states and 11935 transitions. Word has length 297 [2022-01-10 20:09:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:02,827 INFO L470 AbstractCegarLoop]: Abstraction has 8804 states and 11935 transitions. [2022-01-10 20:09:02,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 8804 states and 11935 transitions. [2022-01-10 20:09:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2022-01-10 20:09:02,838 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:02,838 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:02,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:09:02,838 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:02,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:02,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1862847670, now seen corresponding path program 1 times [2022-01-10 20:09:02,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:02,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867185479] [2022-01-10 20:09:02,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:02,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-01-10 20:09:02,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:02,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867185479] [2022-01-10 20:09:02,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867185479] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:02,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:02,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:02,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397614064] [2022-01-10 20:09:02,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:02,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:02,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:02,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:02,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:02,915 INFO L87 Difference]: Start difference. First operand 8804 states and 11935 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 20:09:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:03,124 INFO L93 Difference]: Finished difference Result 18232 states and 24486 transitions. [2022-01-10 20:09:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:03,125 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 298 [2022-01-10 20:09:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:03,138 INFO L225 Difference]: With dead ends: 18232 [2022-01-10 20:09:03,138 INFO L226 Difference]: Without dead ends: 8456 [2022-01-10 20:09:03,147 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 20:09:03,148 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 39 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:03,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 261 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8456 states. [2022-01-10 20:09:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8456 to 8420. [2022-01-10 20:09:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8420 states, 8419 states have (on average 1.3520608148236133) internal successors, (11383), 8419 states have internal predecessors, (11383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8420 states to 8420 states and 11383 transitions. [2022-01-10 20:09:03,325 INFO L78 Accepts]: Start accepts. Automaton has 8420 states and 11383 transitions. Word has length 298 [2022-01-10 20:09:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:03,326 INFO L470 AbstractCegarLoop]: Abstraction has 8420 states and 11383 transitions. [2022-01-10 20:09:03,326 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 20:09:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8420 states and 11383 transitions. [2022-01-10 20:09:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-01-10 20:09:03,335 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:03,335 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:03,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 20:09:03,336 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:03,336 INFO L85 PathProgramCache]: Analyzing trace with hash 715600298, now seen corresponding path program 1 times [2022-01-10 20:09:03,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:03,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147405454] [2022-01-10 20:09:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:03,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 20:09:03,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:03,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147405454] [2022-01-10 20:09:03,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147405454] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:09:03,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857783365] [2022-01-10 20:09:03,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:03,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:09:03,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:09:03,413 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 20:09:03,414 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 20:09:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:03,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 20:09:03,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:09:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2022-01-10 20:09:04,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 20:09:04,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857783365] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:04,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 20:09:04,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 20:09:04,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844656173] [2022-01-10 20:09:04,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:04,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:04,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:09:04,331 INFO L87 Difference]: Start difference. First operand 8420 states and 11383 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:04,433 INFO L93 Difference]: Finished difference Result 12687 states and 17114 transitions. [2022-01-10 20:09:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:04,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 20:09:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:04,445 INFO L225 Difference]: With dead ends: 12687 [2022-01-10 20:09:04,446 INFO L226 Difference]: Without dead ends: 8422 [2022-01-10 20:09:04,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:09:04,452 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 54 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:04,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 464 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2022-01-10 20:09:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 8396. [2022-01-10 20:09:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8396 states, 8395 states have (on average 1.3473496128648004) internal successors, (11311), 8395 states have internal predecessors, (11311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 11311 transitions. [2022-01-10 20:09:04,596 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 11311 transitions. Word has length 308 [2022-01-10 20:09:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:04,597 INFO L470 AbstractCegarLoop]: Abstraction has 8396 states and 11311 transitions. [2022-01-10 20:09:04,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 11311 transitions. [2022-01-10 20:09:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-01-10 20:09:04,605 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:04,605 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 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 20:09:04,627 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 20:09:04,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:09:04,817 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1960364779, now seen corresponding path program 1 times [2022-01-10 20:09:04,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:04,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895036526] [2022-01-10 20:09:04,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:04,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 20:09:04,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:04,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895036526] [2022-01-10 20:09:04,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895036526] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:09:04,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353933287] [2022-01-10 20:09:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:04,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:09:04,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:09:04,942 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 20:09:04,943 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 20:09:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:05,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 20:09:05,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:09:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 20:09:05,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:09:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 20:09:05,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353933287] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:09:05,835 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:09:05,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 20:09:05,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098280986] [2022-01-10 20:09:05,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:09:05,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:09:05,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:05,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:09:05,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:09:05,837 INFO L87 Difference]: Start difference. First operand 8396 states and 11311 transitions. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:07,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:08,501 INFO L93 Difference]: Finished difference Result 15026 states and 20453 transitions. [2022-01-10 20:09:08,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:09:08,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 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 20:09:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:08,517 INFO L225 Difference]: With dead ends: 15026 [2022-01-10 20:09:08,517 INFO L226 Difference]: Without dead ends: 10545 [2022-01-10 20:09:08,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 616 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 20:09:08,523 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 226 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 66 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:08,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 963 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 551 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-10 20:09:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10545 states. [2022-01-10 20:09:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10545 to 8733. [2022-01-10 20:09:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8733 states, 8732 states have (on average 1.3528401282638571) internal successors, (11813), 8732 states have internal predecessors, (11813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8733 states to 8733 states and 11813 transitions. [2022-01-10 20:09:08,700 INFO L78 Accepts]: Start accepts. Automaton has 8733 states and 11813 transitions. Word has length 308 [2022-01-10 20:09:08,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:08,700 INFO L470 AbstractCegarLoop]: Abstraction has 8733 states and 11813 transitions. [2022-01-10 20:09:08,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8733 states and 11813 transitions. [2022-01-10 20:09:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-01-10 20:09:08,709 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:08,709 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 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 20:09:08,728 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 20:09:08,928 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,SelfDestructingSolverStorable20 [2022-01-10 20:09:08,928 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:08,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash 350059011, now seen corresponding path program 1 times [2022-01-10 20:09:08,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:08,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280094603] [2022-01-10 20:09:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:08,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 20:09:09,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:09,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280094603] [2022-01-10 20:09:09,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280094603] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:09:09,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761393904] [2022-01-10 20:09:09,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:09,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:09:09,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:09:09,041 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 20:09:09,042 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 20:09:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:09,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 20:09:09,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:09:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 20:09:09,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:09:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 20:09:09,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761393904] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:09:09,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:09:09,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-01-10 20:09:09,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848647571] [2022-01-10 20:09:09,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:09:09,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:09:09,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:09,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:09:09,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:09:09,882 INFO L87 Difference]: Start difference. First operand 8733 states and 11813 transitions. Second operand has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:10,244 INFO L93 Difference]: Finished difference Result 11280 states and 15302 transitions. [2022-01-10 20:09:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 20:09:10,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 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 20:09:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:10,253 INFO L225 Difference]: With dead ends: 11280 [2022-01-10 20:09:10,253 INFO L226 Difference]: Without dead ends: 4648 [2022-01-10 20:09:10,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:09:10,259 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 97 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:10,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 807 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 20:09:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2022-01-10 20:09:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 4500. [2022-01-10 20:09:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4500 states, 4499 states have (on average 1.3585241164703268) internal successors, (6112), 4499 states have internal predecessors, (6112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4500 states to 4500 states and 6112 transitions. [2022-01-10 20:09:10,327 INFO L78 Accepts]: Start accepts. Automaton has 4500 states and 6112 transitions. Word has length 309 [2022-01-10 20:09:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:10,327 INFO L470 AbstractCegarLoop]: Abstraction has 4500 states and 6112 transitions. [2022-01-10 20:09:10,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 6112 transitions. [2022-01-10 20:09:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2022-01-10 20:09:10,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:10,332 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:10,379 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 20:09:10,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:09:10,550 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:10,550 INFO L85 PathProgramCache]: Analyzing trace with hash 95067560, now seen corresponding path program 1 times [2022-01-10 20:09:10,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:10,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391072149] [2022-01-10 20:09:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:10,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-01-10 20:09:10,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:10,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391072149] [2022-01-10 20:09:10,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391072149] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:09:10,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116427225] [2022-01-10 20:09:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:10,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:09:10,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:09:10,644 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 20:09:10,645 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 20:09:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:10,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 20:09:10,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:09:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-01-10 20:09:11,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:09:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-01-10 20:09:11,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116427225] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:09:11,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:09:11,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 20:09:11,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450541512] [2022-01-10 20:09:11,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:09:11,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:09:11,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:09:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:09:11,515 INFO L87 Difference]: Start difference. First operand 4500 states and 6112 transitions. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:11,733 INFO L93 Difference]: Finished difference Result 6470 states and 8675 transitions. [2022-01-10 20:09:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:09:11,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 334 [2022-01-10 20:09:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:11,733 INFO L225 Difference]: With dead ends: 6470 [2022-01-10 20:09:11,734 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 20:09:11,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 667 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 20:09:11,736 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 191 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:11,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 467 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:09:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 20:09:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 20:09:11,737 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 20:09:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 20:09:11,737 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 334 [2022-01-10 20:09:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:11,737 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 20:09:11,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 20:09:11,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 20:09:11,739 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 20:09:11,759 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 20:09:11,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:09:11,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 20:09:18,573 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 20:09:18,573 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 20:09:18,573 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 92) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L87-2(lines 84 92) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L87(lines 87 91) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L94-1(lines 76 630) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L109-1(lines 76 630) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L861 garLoopResultBuilder]: At program point L613(lines 108 614) the Hoare annotation is: true [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 581) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L617-2(lines 617 621) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L854 garLoopResultBuilder]: At program point L113(lines 112 581) the Hoare annotation is: (and (= 12292 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) [2022-01-10 20:09:18,574 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 580) no Hoare annotation was computed. [2022-01-10 20:09:18,574 INFO L861 garLoopResultBuilder]: At program point L628(lines 76 630) the Hoare annotation is: true [2022-01-10 20:09:18,574 INFO L854 garLoopResultBuilder]: At program point L218(lines 115 580) the Hoare annotation is: (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2) [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 579) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L861 garLoopResultBuilder]: At program point L629(lines 18 631) the Hoare annotation is: true [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 578) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L861 garLoopResultBuilder]: At program point L640(lines 632 642) the Hoare annotation is: true [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L223-2(lines 213 545) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 577) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L235(lines 235 252) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L127(lines 127 576) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 242) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L235-2(lines 213 545) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L854 garLoopResultBuilder]: At program point L131(lines 127 576) the Hoare annotation is: (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4384) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 575) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2022-01-10 20:09:18,575 INFO L858 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 574) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L854 garLoopResultBuilder]: At program point L546(lines 109 612) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse2 (<= 4352 |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)) (.cse5 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4528) (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (and .cse0 (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse1 .cse2 (not .cse3)) (and .cse0 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560) .cse4 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse5) (and .cse0 .cse3 .cse1 .cse2 .cse4 .cse5) (and .cse0 (= 4416 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 3) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2))) [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L273-2(lines 213 545) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L854 garLoopResultBuilder]: At program point L137(lines 133 574) the Hoare annotation is: (and (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4432) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 573) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L583(lines 583 607) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L582(lines 582 610) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L295(lines 295 303) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 572) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L584(lines 584 593) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 213 545) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 302) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L854 garLoopResultBuilder]: At program point L143(lines 139 572) the Hoare annotation is: (and (< 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4432) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 571) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L584-2(lines 583 605) no Hoare annotation was computed. [2022-01-10 20:09:18,576 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L319-1(lines 319 333) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 570) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 601) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L310-2(lines 310 314) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L323-2(lines 321 333) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L854 garLoopResultBuilder]: At program point L149(lines 145 570) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (< 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4432)) [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 569) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L340(lines 340 344) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 568) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L340-2(lines 213 545) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L854 garLoopResultBuilder]: At program point L155(lines 151 568) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4448) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 567) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L352(lines 352 357) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 566) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L854 garLoopResultBuilder]: At program point L363(lines 76 630) the Hoare annotation is: false [2022-01-10 20:09:18,577 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2022-01-10 20:09:18,577 INFO L854 garLoopResultBuilder]: At program point L161(lines 157 566) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4464) (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 20:09:18,581 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 565) no Hoare annotation was computed. [2022-01-10 20:09:18,581 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2022-01-10 20:09:18,581 INFO L858 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-01-10 20:09:18,581 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 564) no Hoare annotation was computed. [2022-01-10 20:09:18,581 INFO L858 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2022-01-10 20:09:18,582 INFO L854 garLoopResultBuilder]: At program point L173(lines 163 564) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4480) (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 20:09:18,582 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 563) no Hoare annotation was computed. [2022-01-10 20:09:18,582 INFO L858 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2022-01-10 20:09:18,582 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-01-10 20:09:18,583 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 562) no Hoare annotation was computed. [2022-01-10 20:09:18,583 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 561) no Hoare annotation was computed. [2022-01-10 20:09:18,583 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 560) no Hoare annotation was computed. [2022-01-10 20:09:18,583 INFO L854 garLoopResultBuilder]: At program point L179(lines 175 560) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4512) (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 20:09:18,583 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 559) no Hoare annotation was computed. [2022-01-10 20:09:18,583 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 410) no Hoare annotation was computed. [2022-01-10 20:09:18,583 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 558) no Hoare annotation was computed. [2022-01-10 20:09:18,583 INFO L858 garLoopResultBuilder]: For program point L412(lines 412 417) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L854 garLoopResultBuilder]: At program point L185(lines 181 558) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4512) (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 557) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L412-2(lines 412 417) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 556) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L854 garLoopResultBuilder]: At program point L191(lines 187 556) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4528) (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 555) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L435(lines 435 439) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 554) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L854 garLoopResultBuilder]: At program point L197(lines 193 554) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0))) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560) .cse1))) [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 553) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L443-2(lines 213 545) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L464(lines 464 468) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 552) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 459) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L471(lines 471 482) no Hoare annotation was computed. [2022-01-10 20:09:18,585 INFO L854 garLoopResultBuilder]: At program point L203(lines 199 552) the Hoare annotation is: (or (and (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) [2022-01-10 20:09:18,585 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 551) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L473(lines 473 479) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L471-1(lines 471 482) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 550) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L493(lines 493 497) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L854 garLoopResultBuilder]: At program point L206(lines 205 550) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4)) (.cse3 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse2 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse1 .cse2 (not .cse3)) (and .cse0 .cse3 .cse1 .cse2 (<= |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 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 549) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L504(lines 504 509) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L501-1(lines 501 513) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L861 garLoopResultBuilder]: At program point L209(lines 208 549) the Hoare annotation is: true [2022-01-10 20:09:18,586 INFO L861 garLoopResultBuilder]: At program point L212(lines 211 548) the Hoare annotation is: true [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L517-1(lines 213 545) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L522-1(lines 522 526) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L529-2(lines 529 533) no Hoare annotation was computed. [2022-01-10 20:09:18,586 INFO L858 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-01-10 20:09:18,590 INFO L732 BasicCegarLoop]: Path program histogram: [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 20:09:18,591 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:09:18,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:09:18 BasicIcfg [2022-01-10 20:09:18,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:09:18,626 INFO L158 Benchmark]: Toolchain (without parser) took 30705.56ms. Allocated memory was 205.5MB in the beginning and 681.6MB in the end (delta: 476.1MB). Free memory was 155.5MB in the beginning and 255.3MB in the end (delta: -99.8MB). Peak memory consumption was 459.3MB. Max. memory is 8.0GB. [2022-01-10 20:09:18,626 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 172.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:09:18,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.91ms. Allocated memory is still 205.5MB. Free memory was 155.2MB in the beginning and 178.8MB in the end (delta: -23.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 20:09:18,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.24ms. Allocated memory is still 205.5MB. Free memory was 178.8MB in the beginning and 176.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 20:09:18,627 INFO L158 Benchmark]: Boogie Preprocessor took 22.48ms. Allocated memory is still 205.5MB. Free memory was 176.2MB in the beginning and 174.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 20:09:18,627 INFO L158 Benchmark]: RCFGBuilder took 457.74ms. Allocated memory is still 205.5MB. Free memory was 174.1MB in the beginning and 149.4MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-01-10 20:09:18,627 INFO L158 Benchmark]: IcfgTransformer took 130.23ms. Allocated memory is still 205.5MB. Free memory was 149.4MB in the beginning and 131.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-10 20:09:18,627 INFO L158 Benchmark]: TraceAbstraction took 29793.67ms. Allocated memory was 205.5MB in the beginning and 681.6MB in the end (delta: 476.1MB). Free memory was 130.6MB in the beginning and 255.3MB in the end (delta: -124.8MB). Peak memory consumption was 435.7MB. Max. memory is 8.0GB. [2022-01-10 20:09:18,628 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.09ms. Allocated memory is still 205.5MB. Free memory is still 172.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.91ms. Allocated memory is still 205.5MB. Free memory was 155.2MB in the beginning and 178.8MB in the end (delta: -23.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.24ms. Allocated memory is still 205.5MB. Free memory was 178.8MB in the beginning and 176.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.48ms. Allocated memory is still 205.5MB. Free memory was 176.2MB in the beginning and 174.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 457.74ms. Allocated memory is still 205.5MB. Free memory was 174.1MB in the beginning and 149.4MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * IcfgTransformer took 130.23ms. Allocated memory is still 205.5MB. Free memory was 149.4MB in the beginning and 131.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 29793.67ms. Allocated memory was 205.5MB in the beginning and 681.6MB in the end (delta: 476.1MB). Free memory was 130.6MB in the beginning and 255.3MB in the end (delta: -124.8MB). Peak memory consumption was 435.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: 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, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 23, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 2024 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2024 mSDsluCounter, 7672 SdHoareTripleChecker+Invalid, 12.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3312 mSDsCounter, 626 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2784 IncrementalHoareTripleChecker+Invalid, 3415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 626 mSolverCounterUnsat, 4360 mSDtfsCounter, 2784 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2286 GetRequests, 2245 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8804occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 3706 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 363 NumberOfFragments, 280 HoareAnnotationTreeSize, 23 FomulaSimplifications, 93060 FormulaSimplificationTreeSizeReduction, 5.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 77698 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 5608 NumberOfCodeBlocks, 5608 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6529 ConstructedInterpolants, 0 QuantifiedInterpolants, 9312 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5135 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 20328/20427 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: 109]: Loop Invariant Derived loop invariant: (((((~bvule32(blastFlag, 2bv32) || (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(blastFlag, 4bv32)) && ~bvule32(4560bv32, s__state))) || ((~bvule32(s__state, 4528bv32) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32))) || ~bvule32(s__state, 3bv32)) || (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(blastFlag, 4bv32)) && ~bvule32(s__state, 4352bv32))) || ((((!(0bv32 == s__hit) && ~bvule32(4352bv32, s__state)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(blastFlag, 4bv32)) && ~bvule32(s__state, 4352bv32))) || (s__state == 4416bv32 && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (~bvule32(s__state, 4480bv32) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (~bvule32(4432bv32, s__state) && ~bvule32(s__state, 4512bv32)) && ~bvule32(blastFlag, 4bv32) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((!(0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) || ((~bvule32(s__state, 4560bv32) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (~bvult64(4384bv32, s__state) && ~bvule32(s__state, 4432bv32)) && ~bvule32(blastFlag, 4bv32) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 4384bv32)) && ~bvule32(4352bv32, s__state) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ~bvule32(blastFlag, 2bv32) && s__state == 12292bv32 - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && ~bvule32(4560bv32, s__state)) || (0bv32 == s__hit && ~bvule32(4432bv32, s__state)) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (~bvule32(s__state, 4464bv32) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && ~bvule32(4352bv32, s__state)) && ~bvule32(s__state, 4432bv32) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (~bvule32(s__state, 4528bv32) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (~bvule32(4432bv32, s__state) && ~bvule32(s__state, 4512bv32)) && ~bvule32(blastFlag, 4bv32) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && ~bvult64(4384bv32, s__state)) && ~bvule32(s__state, 4432bv32) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (~bvule32(4432bv32, s__state) && ~bvule32(blastFlag, 4bv32)) && ~bvule32(s__state, 4448bv32) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && ~bvule32(4352bv32, s__state)) && ~bvule32(s__state, 4352bv32)) || (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(blastFlag, 4bv32)) && ~bvule32(s__state, 4352bv32))) || ((((!(0bv32 == s__hit) && ~bvule32(4352bv32, s__state)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(blastFlag, 4bv32)) && ~bvule32(s__state, 4352bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 20:09:18,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...