/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_SUM.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_8.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:30:25,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:30:25,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:30:25,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:30:25,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:30:25,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:30:25,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:30:25,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:30:25,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:30:25,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:30:25,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:30:25,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:30:25,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:30:25,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:30:25,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:30:25,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:30:25,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:30:25,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:30:25,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:30:25,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:30:25,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:30:25,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:30:25,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:30:25,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:30:25,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:30:25,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:30:25,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:30:25,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:30:25,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:30:25,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:30:25,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:30:25,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:30:25,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:30:25,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:30:25,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:30:25,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:30:25,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:30:25,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:30:25,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:30:25,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:30:25,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:30:25,821 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:30:25,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:30:25,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:30:25,847 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:30:25,847 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:30:25,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:30:25,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:30:25,848 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:30:25,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:30:25,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:30:25,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:30:25,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:30:25,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:30:25,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:30:25,849 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:30:25,849 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:30:25,849 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:30:25,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:30:25,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:30:25,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:30:25,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:30:25,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:30:25,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:25,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:30:25,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:30:25,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:30:25,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:30:25,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:30:25,851 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:30:25,851 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:30:25,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:30:25,851 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:30:25,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:30:25,852 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:30:25,852 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 03:30:26,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:30:26,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:30:26,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:30:26,084 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:30:26,084 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:30:26,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_8.cil.c [2022-01-11 03:30:26,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0172c82ab/66b5fd6f78214e1eaaf8f92053b4000e/FLAGf6b576032 [2022-01-11 03:30:26,528 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:30:26,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_8.cil.c [2022-01-11 03:30:26,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0172c82ab/66b5fd6f78214e1eaaf8f92053b4000e/FLAGf6b576032 [2022-01-11 03:30:26,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0172c82ab/66b5fd6f78214e1eaaf8f92053b4000e [2022-01-11 03:30:26,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:30:26,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:30:26,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:26,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:30:26,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:30:26,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ef058d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26, skipping insertion in model container [2022-01-11 03:30:26,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:30:26,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:30:26,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_8.cil.c[44970,44983] [2022-01-11 03:30:26,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:26,834 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:30:26,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_8.cil.c[44970,44983] [2022-01-11 03:30:26,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:26,899 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:30:26,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26 WrapperNode [2022-01-11 03:30:26,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:26,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:26,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:30:26,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:30:26,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,952 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 512 [2022-01-11 03:30:26,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:26,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:30:26,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:30:26,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:30:26,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:26,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:30:26,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:30:26,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:30:26,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:30:27,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (1/1) ... [2022-01-11 03:30:27,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:27,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:27,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 03:30:27,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 03:30:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:30:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:30:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:30:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:30:27,218 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:30:27,219 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:30:27,229 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:30:27,550 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-11 03:30:27,551 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-11 03:30:27,551 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:30:27,556 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:30:27,557 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:30:27,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:27 BoogieIcfgContainer [2022-01-11 03:30:27,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:30:27,559 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:30:27,559 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:30:27,560 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:30:27,562 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:27" (1/1) ... [2022-01-11 03:30:27,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:27 BasicIcfg [2022-01-11 03:30:27,716 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:30:27,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:30:27,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:30:27,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:30:27,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:30:26" (1/4) ... [2022-01-11 03:30:27,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8923a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:27, skipping insertion in model container [2022-01-11 03:30:27,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:26" (2/4) ... [2022-01-11 03:30:27,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8923a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:27, skipping insertion in model container [2022-01-11 03:30:27,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:27" (3/4) ... [2022-01-11 03:30:27,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8923a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:27, skipping insertion in model container [2022-01-11 03:30:27,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:27" (4/4) ... [2022-01-11 03:30:27,721 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.cTransformedIcfg [2022-01-11 03:30:27,724 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:30:27,725 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:30:27,757 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:30:27,763 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 03:30:27,763 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:30:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.7379310344827585) internal successors, (252), 146 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:27,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-11 03:30:27,787 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:27,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:27,788 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:27,795 INFO L85 PathProgramCache]: Analyzing trace with hash -266489712, now seen corresponding path program 1 times [2022-01-11 03:30:27,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:27,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053340170] [2022-01-11 03:30:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:27,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:28,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:28,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053340170] [2022-01-11 03:30:28,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053340170] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:28,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:28,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:28,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384573921] [2022-01-11 03:30:28,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:28,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:28,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:28,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:28,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:28,119 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.7379310344827585) internal successors, (252), 146 states have internal predecessors, (252), 0 states have call successors, (0), 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 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:28,208 INFO L93 Difference]: Finished difference Result 422 states and 726 transitions. [2022-01-11 03:30:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:28,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-01-11 03:30:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:28,222 INFO L225 Difference]: With dead ends: 422 [2022-01-11 03:30:28,222 INFO L226 Difference]: Without dead ends: 257 [2022-01-11 03:30:28,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:28,229 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 194 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:28,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 453 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-01-11 03:30:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-01-11 03:30:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.52734375) internal successors, (391), 256 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 391 transitions. [2022-01-11 03:30:28,286 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 391 transitions. Word has length 42 [2022-01-11 03:30:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:28,286 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 391 transitions. [2022-01-11 03:30:28,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2022-01-11 03:30:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-11 03:30:28,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:28,288 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 03:30:28,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:30:28,289 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:28,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1303217823, now seen corresponding path program 1 times [2022-01-11 03:30:28,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:28,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385486294] [2022-01-11 03:30:28,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:28,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:28,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:28,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385486294] [2022-01-11 03:30:28,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385486294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:28,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:28,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:28,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628431713] [2022-01-11 03:30:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:28,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:28,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:28,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:28,376 INFO L87 Difference]: Start difference. First operand 257 states and 391 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:28,527 INFO L93 Difference]: Finished difference Result 412 states and 636 transitions. [2022-01-11 03:30:28,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:28,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-01-11 03:30:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:28,531 INFO L225 Difference]: With dead ends: 412 [2022-01-11 03:30:28,531 INFO L226 Difference]: Without dead ends: 286 [2022-01-11 03:30:28,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:28,536 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 13 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:28,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 332 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-01-11 03:30:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 278. [2022-01-11 03:30:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.5054151624548737) internal successors, (417), 277 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 417 transitions. [2022-01-11 03:30:28,550 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 417 transitions. Word has length 58 [2022-01-11 03:30:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:28,550 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 417 transitions. [2022-01-11 03:30:28,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 417 transitions. [2022-01-11 03:30:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-11 03:30:28,552 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:28,552 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:30:28,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:30:28,553 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:28,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1870825836, now seen corresponding path program 1 times [2022-01-11 03:30:28,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:28,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553119870] [2022-01-11 03:30:28,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:28,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 03:30:28,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:28,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553119870] [2022-01-11 03:30:28,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553119870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:28,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:28,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:28,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736590873] [2022-01-11 03:30:28,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:28,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:28,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:28,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:28,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:28,636 INFO L87 Difference]: Start difference. First operand 278 states and 417 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:28,791 INFO L93 Difference]: Finished difference Result 658 states and 1014 transitions. [2022-01-11 03:30:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:28,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 79 [2022-01-11 03:30:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:28,793 INFO L225 Difference]: With dead ends: 658 [2022-01-11 03:30:28,793 INFO L226 Difference]: Without dead ends: 388 [2022-01-11 03:30:28,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:28,795 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 43 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:28,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 314 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-01-11 03:30:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 360. [2022-01-11 03:30:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.434540389972145) internal successors, (515), 359 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 515 transitions. [2022-01-11 03:30:28,808 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 515 transitions. Word has length 79 [2022-01-11 03:30:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:28,808 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 515 transitions. [2022-01-11 03:30:28,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 515 transitions. [2022-01-11 03:30:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-11 03:30:28,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:28,810 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:30:28,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:30:28,811 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:28,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash -409245837, now seen corresponding path program 1 times [2022-01-11 03:30:28,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:28,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038637175] [2022-01-11 03:30:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:28,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 03:30:28,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:28,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038637175] [2022-01-11 03:30:28,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038637175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:28,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:28,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:28,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777528520] [2022-01-11 03:30:28,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:28,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:28,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:28,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:28,855 INFO L87 Difference]: Start difference. First operand 360 states and 515 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:28,972 INFO L93 Difference]: Finished difference Result 766 states and 1112 transitions. [2022-01-11 03:30:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:28,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 79 [2022-01-11 03:30:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:28,976 INFO L225 Difference]: With dead ends: 766 [2022-01-11 03:30:28,976 INFO L226 Difference]: Without dead ends: 414 [2022-01-11 03:30:28,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:28,983 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 13 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:28,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 333 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-01-11 03:30:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 406. [2022-01-11 03:30:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.4098765432098765) internal successors, (571), 405 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 571 transitions. [2022-01-11 03:30:28,998 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 571 transitions. Word has length 79 [2022-01-11 03:30:28,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:28,999 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 571 transitions. [2022-01-11 03:30:28,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 571 transitions. [2022-01-11 03:30:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-11 03:30:29,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:29,000 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:30:29,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:30:29,001 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:29,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:29,005 INFO L85 PathProgramCache]: Analyzing trace with hash -46009912, now seen corresponding path program 1 times [2022-01-11 03:30:29,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:29,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416419982] [2022-01-11 03:30:29,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:29,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 03:30:29,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:29,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416419982] [2022-01-11 03:30:29,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416419982] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:29,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:29,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:29,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978085921] [2022-01-11 03:30:29,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:29,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:29,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:29,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:29,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,086 INFO L87 Difference]: Start difference. First operand 406 states and 571 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:29,236 INFO L93 Difference]: Finished difference Result 1000 states and 1427 transitions. [2022-01-11 03:30:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 92 [2022-01-11 03:30:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:29,238 INFO L225 Difference]: With dead ends: 1000 [2022-01-11 03:30:29,239 INFO L226 Difference]: Without dead ends: 596 [2022-01-11 03:30:29,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,240 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 162 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:29,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 182 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-01-11 03:30:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 582. [2022-01-11 03:30:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.4199655765920827) internal successors, (825), 581 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 825 transitions. [2022-01-11 03:30:29,258 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 825 transitions. Word has length 92 [2022-01-11 03:30:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:29,262 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 825 transitions. [2022-01-11 03:30:29,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 825 transitions. [2022-01-11 03:30:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 03:30:29,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:29,269 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:29,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:30:29,269 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1724962655, now seen corresponding path program 1 times [2022-01-11 03:30:29,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:29,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480452736] [2022-01-11 03:30:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:29,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-11 03:30:29,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:29,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480452736] [2022-01-11 03:30:29,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480452736] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:29,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:29,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:29,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847602754] [2022-01-11 03:30:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:29,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:29,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:29,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,380 INFO L87 Difference]: Start difference. First operand 582 states and 825 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:29,473 INFO L93 Difference]: Finished difference Result 1232 states and 1766 transitions. [2022-01-11 03:30:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 100 [2022-01-11 03:30:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:29,477 INFO L225 Difference]: With dead ends: 1232 [2022-01-11 03:30:29,477 INFO L226 Difference]: Without dead ends: 658 [2022-01-11 03:30:29,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,479 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 29 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:29,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 332 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-01-11 03:30:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 632. [2022-01-11 03:30:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.4025356576862125) internal successors, (885), 631 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 885 transitions. [2022-01-11 03:30:29,493 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 885 transitions. Word has length 100 [2022-01-11 03:30:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:29,493 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 885 transitions. [2022-01-11 03:30:29,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 885 transitions. [2022-01-11 03:30:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-11 03:30:29,494 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:29,495 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:29,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:30:29,495 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:29,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash 245703978, now seen corresponding path program 1 times [2022-01-11 03:30:29,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:29,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246621175] [2022-01-11 03:30:29,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:29,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-11 03:30:29,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:29,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246621175] [2022-01-11 03:30:29,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246621175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:29,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:29,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:29,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341384294] [2022-01-11 03:30:29,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:29,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:29,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:29,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:29,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,576 INFO L87 Difference]: Start difference. First operand 632 states and 885 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:29,597 INFO L93 Difference]: Finished difference Result 1866 states and 2605 transitions. [2022-01-11 03:30:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 126 [2022-01-11 03:30:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:29,602 INFO L225 Difference]: With dead ends: 1866 [2022-01-11 03:30:29,602 INFO L226 Difference]: Without dead ends: 1242 [2022-01-11 03:30:29,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,604 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 193 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:29,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 572 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:29,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2022-01-11 03:30:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 634. [2022-01-11 03:30:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.401263823064771) internal successors, (887), 633 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 887 transitions. [2022-01-11 03:30:29,624 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 887 transitions. Word has length 126 [2022-01-11 03:30:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:29,624 INFO L470 AbstractCegarLoop]: Abstraction has 634 states and 887 transitions. [2022-01-11 03:30:29,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 887 transitions. [2022-01-11 03:30:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-11 03:30:29,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:29,626 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:29,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:30:29,626 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash -578383351, now seen corresponding path program 1 times [2022-01-11 03:30:29,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:29,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626406834] [2022-01-11 03:30:29,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:29,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-01-11 03:30:29,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:29,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626406834] [2022-01-11 03:30:29,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626406834] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:29,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:29,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:29,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207782227] [2022-01-11 03:30:29,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:29,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:29,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:29,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,688 INFO L87 Difference]: Start difference. First operand 634 states and 887 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:29,792 INFO L93 Difference]: Finished difference Result 1330 states and 1882 transitions. [2022-01-11 03:30:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:29,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 126 [2022-01-11 03:30:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:29,794 INFO L225 Difference]: With dead ends: 1330 [2022-01-11 03:30:29,794 INFO L226 Difference]: Without dead ends: 704 [2022-01-11 03:30:29,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,796 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:29,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 332 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-01-11 03:30:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 688. [2022-01-11 03:30:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.3842794759825328) internal successors, (951), 687 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 951 transitions. [2022-01-11 03:30:29,814 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 951 transitions. Word has length 126 [2022-01-11 03:30:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:29,815 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 951 transitions. [2022-01-11 03:30:29,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 951 transitions. [2022-01-11 03:30:29,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 03:30:29,816 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:29,816 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:29,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:30:29,817 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:29,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:29,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1372685968, now seen corresponding path program 1 times [2022-01-11 03:30:29,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:29,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107912335] [2022-01-11 03:30:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:29,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-11 03:30:29,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:29,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107912335] [2022-01-11 03:30:29,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107912335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:29,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:29,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:29,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199388360] [2022-01-11 03:30:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:29,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:29,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,860 INFO L87 Difference]: Start difference. First operand 688 states and 951 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,000 INFO L93 Difference]: Finished difference Result 1388 states and 1919 transitions. [2022-01-11 03:30:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-01-11 03:30:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,002 INFO L225 Difference]: With dead ends: 1388 [2022-01-11 03:30:30,003 INFO L226 Difference]: Without dead ends: 706 [2022-01-11 03:30:30,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,005 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 170 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 176 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-01-11 03:30:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 694. [2022-01-11 03:30:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.378066378066378) internal successors, (955), 693 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 955 transitions. [2022-01-11 03:30:30,019 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 955 transitions. Word has length 132 [2022-01-11 03:30:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,020 INFO L470 AbstractCegarLoop]: Abstraction has 694 states and 955 transitions. [2022-01-11 03:30:30,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 955 transitions. [2022-01-11 03:30:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-01-11 03:30:30,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,021 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:30,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:30:30,022 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1817920527, now seen corresponding path program 1 times [2022-01-11 03:30:30,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772522974] [2022-01-11 03:30:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-11 03:30:30,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772522974] [2022-01-11 03:30:30,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772522974] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:30,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:30,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660988260] [2022-01-11 03:30:30,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,078 INFO L87 Difference]: Start difference. First operand 694 states and 955 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,180 INFO L93 Difference]: Finished difference Result 1442 states and 2004 transitions. [2022-01-11 03:30:30,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 149 [2022-01-11 03:30:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,182 INFO L225 Difference]: With dead ends: 1442 [2022-01-11 03:30:30,182 INFO L226 Difference]: Without dead ends: 756 [2022-01-11 03:30:30,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,187 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 10 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 332 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-01-11 03:30:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 752. [2022-01-11 03:30:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 1.3621837549933422) internal successors, (1023), 751 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1023 transitions. [2022-01-11 03:30:30,203 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1023 transitions. Word has length 149 [2022-01-11 03:30:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,204 INFO L470 AbstractCegarLoop]: Abstraction has 752 states and 1023 transitions. [2022-01-11 03:30:30,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1023 transitions. [2022-01-11 03:30:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 03:30:30,206 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,206 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:30,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:30:30,206 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1309856413, now seen corresponding path program 1 times [2022-01-11 03:30:30,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047890258] [2022-01-11 03:30:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-11 03:30:30,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047890258] [2022-01-11 03:30:30,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047890258] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:30,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:30,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925015026] [2022-01-11 03:30:30,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,289 INFO L87 Difference]: Start difference. First operand 752 states and 1023 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,397 INFO L93 Difference]: Finished difference Result 1558 states and 2144 transitions. [2022-01-11 03:30:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 154 [2022-01-11 03:30:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,400 INFO L225 Difference]: With dead ends: 1558 [2022-01-11 03:30:30,400 INFO L226 Difference]: Without dead ends: 814 [2022-01-11 03:30:30,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,402 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 15 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 314 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-01-11 03:30:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2022-01-11 03:30:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.3468634686346863) internal successors, (1095), 813 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1095 transitions. [2022-01-11 03:30:30,418 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1095 transitions. Word has length 154 [2022-01-11 03:30:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,419 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1095 transitions. [2022-01-11 03:30:30,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1095 transitions. [2022-01-11 03:30:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-01-11 03:30:30,420 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,421 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:30,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:30:30,421 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,421 INFO L85 PathProgramCache]: Analyzing trace with hash 52883762, now seen corresponding path program 1 times [2022-01-11 03:30:30,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328417338] [2022-01-11 03:30:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-11 03:30:30,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328417338] [2022-01-11 03:30:30,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328417338] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:30,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985368431] [2022-01-11 03:30:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:30,491 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-11 03:30:30,507 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-11 03:30:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-11 03:30:30,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-01-11 03:30:30,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:30,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985368431] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:30,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:30,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11238009] [2022-01-11 03:30:30,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:30,939 INFO L87 Difference]: Start difference. First operand 814 states and 1095 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,982 INFO L93 Difference]: Finished difference Result 1642 states and 2216 transitions. [2022-01-11 03:30:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2022-01-11 03:30:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,985 INFO L225 Difference]: With dead ends: 1642 [2022-01-11 03:30:30,985 INFO L226 Difference]: Without dead ends: 1227 [2022-01-11 03:30:30,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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-11 03:30:30,987 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 134 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 369 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-01-11 03:30:31,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1227. [2022-01-11 03:30:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1226 states have (on average 1.3433931484502446) internal successors, (1647), 1226 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1647 transitions. [2022-01-11 03:30:31,011 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1647 transitions. Word has length 182 [2022-01-11 03:30:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,012 INFO L470 AbstractCegarLoop]: Abstraction has 1227 states and 1647 transitions. [2022-01-11 03:30:31,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1647 transitions. [2022-01-11 03:30:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-01-11 03:30:31,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,014 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2022-01-11 03:30:31,050 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-11 03:30:31,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-11 03:30:31,237 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2111975809, now seen corresponding path program 1 times [2022-01-11 03:30:31,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020286470] [2022-01-11 03:30:31,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-01-11 03:30:31,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020286470] [2022-01-11 03:30:31,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020286470] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254250795] [2022-01-11 03:30:31,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,303 INFO L87 Difference]: Start difference. First operand 1227 states and 1647 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,343 INFO L93 Difference]: Finished difference Result 3584 states and 4821 transitions. [2022-01-11 03:30:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2022-01-11 03:30:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,350 INFO L225 Difference]: With dead ends: 3584 [2022-01-11 03:30:31,350 INFO L226 Difference]: Without dead ends: 2365 [2022-01-11 03:30:31,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,353 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 143 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 587 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2022-01-11 03:30:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2022-01-11 03:30:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2362 states have (on average 1.344623200677392) internal successors, (3176), 2362 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3176 transitions. [2022-01-11 03:30:31,405 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3176 transitions. Word has length 189 [2022-01-11 03:30:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,405 INFO L470 AbstractCegarLoop]: Abstraction has 2363 states and 3176 transitions. [2022-01-11 03:30:31,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3176 transitions. [2022-01-11 03:30:31,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-01-11 03:30:31,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,409 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2022-01-11 03:30:31,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:30:31,409 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,410 INFO L85 PathProgramCache]: Analyzing trace with hash -512477918, now seen corresponding path program 1 times [2022-01-11 03:30:31,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119450196] [2022-01-11 03:30:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-11 03:30:31,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119450196] [2022-01-11 03:30:31,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119450196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569046875] [2022-01-11 03:30:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,481 INFO L87 Difference]: Start difference. First operand 2363 states and 3176 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,552 INFO L93 Difference]: Finished difference Result 4713 states and 6357 transitions. [2022-01-11 03:30:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2022-01-11 03:30:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,561 INFO L225 Difference]: With dead ends: 4713 [2022-01-11 03:30:31,561 INFO L226 Difference]: Without dead ends: 3113 [2022-01-11 03:30:31,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,564 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 561 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2022-01-11 03:30:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 3113. [2022-01-11 03:30:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3113 states, 3112 states have (on average 1.3444730077120823) internal successors, (4184), 3112 states have internal predecessors, (4184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 4184 transitions. [2022-01-11 03:30:31,631 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 4184 transitions. Word has length 189 [2022-01-11 03:30:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,631 INFO L470 AbstractCegarLoop]: Abstraction has 3113 states and 4184 transitions. [2022-01-11 03:30:31,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 4184 transitions. [2022-01-11 03:30:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-11 03:30:31,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,636 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2022-01-11 03:30:31,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:30:31,636 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1130987486, now seen corresponding path program 1 times [2022-01-11 03:30:31,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534733180] [2022-01-11 03:30:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-01-11 03:30:31,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534733180] [2022-01-11 03:30:31,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534733180] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059250827] [2022-01-11 03:30:31,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,673 INFO L87 Difference]: Start difference. First operand 3113 states and 4184 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,741 INFO L93 Difference]: Finished difference Result 5565 states and 7471 transitions. [2022-01-11 03:30:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2022-01-11 03:30:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,750 INFO L225 Difference]: With dead ends: 5565 [2022-01-11 03:30:31,750 INFO L226 Difference]: Without dead ends: 3215 [2022-01-11 03:30:31,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,754 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 17 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 446 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2022-01-11 03:30:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 3215. [2022-01-11 03:30:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 3214 states have (on average 1.3378967019290604) internal successors, (4300), 3214 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4300 transitions. [2022-01-11 03:30:31,828 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4300 transitions. Word has length 190 [2022-01-11 03:30:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,828 INFO L470 AbstractCegarLoop]: Abstraction has 3215 states and 4300 transitions. [2022-01-11 03:30:31,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4300 transitions. [2022-01-11 03:30:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-01-11 03:30:31,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,833 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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-11 03:30:31,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 03:30:31,834 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1812987122, now seen corresponding path program 1 times [2022-01-11 03:30:31,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694124789] [2022-01-11 03:30:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-01-11 03:30:31,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694124789] [2022-01-11 03:30:31,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694124789] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466919634] [2022-01-11 03:30:31,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,886 INFO L87 Difference]: Start difference. First operand 3215 states and 4300 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:32,088 INFO L93 Difference]: Finished difference Result 6742 states and 9164 transitions. [2022-01-11 03:30:32,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:32,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 227 [2022-01-11 03:30:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:32,094 INFO L225 Difference]: With dead ends: 6742 [2022-01-11 03:30:32,094 INFO L226 Difference]: Without dead ends: 2019 [2022-01-11 03:30:32,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,100 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 11 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:32,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 332 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:32,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2022-01-11 03:30:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2022-01-11 03:30:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2018 states have (on average 1.3325074331020812) internal successors, (2689), 2018 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2689 transitions. [2022-01-11 03:30:32,150 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 2689 transitions. Word has length 227 [2022-01-11 03:30:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:32,151 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 2689 transitions. [2022-01-11 03:30:32,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2689 transitions. [2022-01-11 03:30:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2022-01-11 03:30:32,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:32,158 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:32,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 03:30:32,158 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:32,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:32,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1543995167, now seen corresponding path program 1 times [2022-01-11 03:30:32,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:32,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410030816] [2022-01-11 03:30:32,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:32,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2022-01-11 03:30:32,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:32,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410030816] [2022-01-11 03:30:32,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410030816] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:32,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831826670] [2022-01-11 03:30:32,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:32,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:32,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:32,249 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-11 03:30:32,250 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-11 03:30:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:32,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:32,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2022-01-11 03:30:32,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:32,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831826670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:32,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:32,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:32,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575791257] [2022-01-11 03:30:32,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:32,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:32,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:32,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:32,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:32,933 INFO L87 Difference]: Start difference. First operand 2019 states and 2689 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:32,997 INFO L93 Difference]: Finished difference Result 4392 states and 5870 transitions. [2022-01-11 03:30:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:32,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 442 [2022-01-11 03:30:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:33,004 INFO L225 Difference]: With dead ends: 4392 [2022-01-11 03:30:33,005 INFO L226 Difference]: Without dead ends: 2386 [2022-01-11 03:30:33,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 442 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-11 03:30:33,008 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 135 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:33,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 551 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2022-01-11 03:30:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2022-01-11 03:30:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2385 states have (on average 1.3337526205450734) internal successors, (3181), 2385 states have internal predecessors, (3181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 3181 transitions. [2022-01-11 03:30:33,060 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 3181 transitions. Word has length 442 [2022-01-11 03:30:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:33,060 INFO L470 AbstractCegarLoop]: Abstraction has 2386 states and 3181 transitions. [2022-01-11 03:30:33,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 3181 transitions. [2022-01-11 03:30:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2022-01-11 03:30:33,067 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:33,067 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:33,086 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-11 03:30:33,283 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,SelfDestructingSolverStorable16 [2022-01-11 03:30:33,283 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash -775070569, now seen corresponding path program 1 times [2022-01-11 03:30:33,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:33,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389569086] [2022-01-11 03:30:33,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:33,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2022-01-11 03:30:33,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:33,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389569086] [2022-01-11 03:30:33,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389569086] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:33,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126370254] [2022-01-11 03:30:33,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:33,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:33,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:33,391 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-11 03:30:33,392 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-11 03:30:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:33,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 1664 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:33,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2022-01-11 03:30:34,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:34,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126370254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:34,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:34,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:34,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761911329] [2022-01-11 03:30:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:34,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:34,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:34,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:34,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:34,067 INFO L87 Difference]: Start difference. First operand 2386 states and 3181 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:34,121 INFO L93 Difference]: Finished difference Result 4480 states and 5961 transitions. [2022-01-11 03:30:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:34,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 443 [2022-01-11 03:30:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:34,128 INFO L225 Difference]: With dead ends: 4480 [2022-01-11 03:30:34,129 INFO L226 Difference]: Without dead ends: 2438 [2022-01-11 03:30:34,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 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-11 03:30:34,132 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 17 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:34,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 440 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2022-01-11 03:30:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2438. [2022-01-11 03:30:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2438 states, 2437 states have (on average 1.3290931473122691) internal successors, (3239), 2437 states have internal predecessors, (3239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 3239 transitions. [2022-01-11 03:30:34,184 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 3239 transitions. Word has length 443 [2022-01-11 03:30:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:34,184 INFO L470 AbstractCegarLoop]: Abstraction has 2438 states and 3239 transitions. [2022-01-11 03:30:34,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 3239 transitions. [2022-01-11 03:30:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2022-01-11 03:30:34,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:34,191 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:34,225 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-11 03:30:34,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-11 03:30:34,411 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:34,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:34,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1481785597, now seen corresponding path program 1 times [2022-01-11 03:30:34,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:34,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254448007] [2022-01-11 03:30:34,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:34,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2022-01-11 03:30:34,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:34,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254448007] [2022-01-11 03:30:34,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254448007] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:34,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326592020] [2022-01-11 03:30:34,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:34,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:34,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:34,485 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-11 03:30:34,508 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-11 03:30:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:34,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:34,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2022-01-11 03:30:35,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:35,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326592020] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:35,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:35,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:35,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11678454] [2022-01-11 03:30:35,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:35,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:35,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:35,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:35,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:35,156 INFO L87 Difference]: Start difference. First operand 2438 states and 3239 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:35,203 INFO L93 Difference]: Finished difference Result 4527 states and 6006 transitions. [2022-01-11 03:30:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:35,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 444 [2022-01-11 03:30:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:35,222 INFO L225 Difference]: With dead ends: 4527 [2022-01-11 03:30:35,222 INFO L226 Difference]: Without dead ends: 2485 [2022-01-11 03:30:35,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 444 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-11 03:30:35,226 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:35,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 436 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2022-01-11 03:30:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2485. [2022-01-11 03:30:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 2484 states have (on average 1.3248792270531402) internal successors, (3291), 2484 states have internal predecessors, (3291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3291 transitions. [2022-01-11 03:30:35,282 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3291 transitions. Word has length 444 [2022-01-11 03:30:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:35,283 INFO L470 AbstractCegarLoop]: Abstraction has 2485 states and 3291 transitions. [2022-01-11 03:30:35,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3291 transitions. [2022-01-11 03:30:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2022-01-11 03:30:35,292 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:35,293 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:35,325 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-11 03:30:35,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:35,512 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1449126804, now seen corresponding path program 1 times [2022-01-11 03:30:35,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:35,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580587488] [2022-01-11 03:30:35,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:35,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-01-11 03:30:35,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:35,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580587488] [2022-01-11 03:30:35,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580587488] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:35,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645420992] [2022-01-11 03:30:35,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:35,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:35,597 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:30:35,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-11 03:30:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:35,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 2189 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:35,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-01-11 03:30:36,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-01-11 03:30:37,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645420992] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:37,207 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:37,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:37,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620435205] [2022-01-11 03:30:37,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:37,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:37,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:37,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:37,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:37,209 INFO L87 Difference]: Start difference. First operand 2485 states and 3291 transitions. Second operand has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:37,620 INFO L93 Difference]: Finished difference Result 6045 states and 8162 transitions. [2022-01-11 03:30:37,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 03:30:37,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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 595 [2022-01-11 03:30:37,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:37,627 INFO L225 Difference]: With dead ends: 6045 [2022-01-11 03:30:37,627 INFO L226 Difference]: Without dead ends: 3426 [2022-01-11 03:30:37,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1192 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-11 03:30:37,632 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 649 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:37,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [649 Valid, 733 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:30:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2022-01-11 03:30:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 2515. [2022-01-11 03:30:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2514 states have (on average 1.3349244232299124) internal successors, (3356), 2514 states have internal predecessors, (3356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3356 transitions. [2022-01-11 03:30:37,688 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 3356 transitions. Word has length 595 [2022-01-11 03:30:37,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:37,688 INFO L470 AbstractCegarLoop]: Abstraction has 2515 states and 3356 transitions. [2022-01-11 03:30:37,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3356 transitions. [2022-01-11 03:30:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2022-01-11 03:30:37,700 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:37,700 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 13, 10, 10, 10, 10, 10, 10, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:30:37,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-11 03:30:37,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:37,927 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1628037089, now seen corresponding path program 1 times [2022-01-11 03:30:37,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:37,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067661264] [2022-01-11 03:30:37,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:37,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 2504 proven. 0 refuted. 0 times theorem prover too weak. 3124 trivial. 0 not checked. [2022-01-11 03:30:38,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:38,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067661264] [2022-01-11 03:30:38,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067661264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:38,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:38,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:38,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95121581] [2022-01-11 03:30:38,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:38,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:38,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:38,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:38,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:38,020 INFO L87 Difference]: Start difference. First operand 2515 states and 3356 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:38,182 INFO L93 Difference]: Finished difference Result 5310 states and 7196 transitions. [2022-01-11 03:30:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:38,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 728 [2022-01-11 03:30:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:38,186 INFO L225 Difference]: With dead ends: 5310 [2022-01-11 03:30:38,186 INFO L226 Difference]: Without dead ends: 2803 [2022-01-11 03:30:38,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:38,189 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 10 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:38,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 329 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2022-01-11 03:30:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2787. [2022-01-11 03:30:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2786 states have (on average 1.3165829145728642) internal successors, (3668), 2786 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 3668 transitions. [2022-01-11 03:30:38,246 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 3668 transitions. Word has length 728 [2022-01-11 03:30:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:38,246 INFO L470 AbstractCegarLoop]: Abstraction has 2787 states and 3668 transitions. [2022-01-11 03:30:38,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3668 transitions. [2022-01-11 03:30:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2022-01-11 03:30:38,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:38,256 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 23, 23, 22, 22, 21, 21, 20, 20, 20, 20, 16, 13, 13, 10, 10, 10, 10, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:30:38,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 03:30:38,257 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:38,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:38,257 INFO L85 PathProgramCache]: Analyzing trace with hash 430094315, now seen corresponding path program 1 times [2022-01-11 03:30:38,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:38,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4488365] [2022-01-11 03:30:38,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:38,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7407 backedges. 3344 proven. 0 refuted. 0 times theorem prover too weak. 4063 trivial. 0 not checked. [2022-01-11 03:30:38,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:38,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4488365] [2022-01-11 03:30:38,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4488365] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:38,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:38,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:38,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868167010] [2022-01-11 03:30:38,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:38,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:38,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:38,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:38,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:38,386 INFO L87 Difference]: Start difference. First operand 2787 states and 3668 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:38,508 INFO L93 Difference]: Finished difference Result 5870 states and 7852 transitions. [2022-01-11 03:30:38,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:38,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 821 [2022-01-11 03:30:38,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:38,515 INFO L225 Difference]: With dead ends: 5870 [2022-01-11 03:30:38,515 INFO L226 Difference]: Without dead ends: 3091 [2022-01-11 03:30:38,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:38,519 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 10 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:38,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 329 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2022-01-11 03:30:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 3075. [2022-01-11 03:30:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3075 states, 3074 states have (on average 1.2999349381912817) internal successors, (3996), 3074 states have internal predecessors, (3996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 3075 states and 3996 transitions. [2022-01-11 03:30:38,570 INFO L78 Accepts]: Start accepts. Automaton has 3075 states and 3996 transitions. Word has length 821 [2022-01-11 03:30:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:38,570 INFO L470 AbstractCegarLoop]: Abstraction has 3075 states and 3996 transitions. [2022-01-11 03:30:38,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 3996 transitions. [2022-01-11 03:30:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2022-01-11 03:30:38,578 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:38,578 INFO L514 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 26, 26, 25, 25, 24, 24, 23, 23, 23, 23, 19, 16, 16, 13, 13, 10, 10, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:30:38,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 03:30:38,579 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash 264356379, now seen corresponding path program 1 times [2022-01-11 03:30:38,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:38,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062278246] [2022-01-11 03:30:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:38,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9513 backedges. 5427 proven. 26 refuted. 0 times theorem prover too weak. 4060 trivial. 0 not checked. [2022-01-11 03:30:38,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:38,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062278246] [2022-01-11 03:30:38,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062278246] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:38,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874604623] [2022-01-11 03:30:38,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:38,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:38,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:38,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:30:38,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-11 03:30:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:39,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 3319 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:39,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9513 backedges. 2021 proven. 0 refuted. 0 times theorem prover too weak. 7492 trivial. 0 not checked. [2022-01-11 03:30:41,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:41,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874604623] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:41,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:41,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:41,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516618869] [2022-01-11 03:30:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:41,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:41,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:41,912 INFO L87 Difference]: Start difference. First operand 3075 states and 3996 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:41,972 INFO L93 Difference]: Finished difference Result 3474 states and 4508 transitions. [2022-01-11 03:30:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:41,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 920 [2022-01-11 03:30:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:41,978 INFO L225 Difference]: With dead ends: 3474 [2022-01-11 03:30:41,978 INFO L226 Difference]: Without dead ends: 2848 [2022-01-11 03:30:41,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 923 GetRequests, 920 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-11 03:30:41,980 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 84 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:41,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 555 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-01-11 03:30:42,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2451. [2022-01-11 03:30:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2450 states have (on average 1.2975510204081633) internal successors, (3179), 2450 states have internal predecessors, (3179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 3179 transitions. [2022-01-11 03:30:42,025 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 3179 transitions. Word has length 920 [2022-01-11 03:30:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:42,026 INFO L470 AbstractCegarLoop]: Abstraction has 2451 states and 3179 transitions. [2022-01-11 03:30:42,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3179 transitions. [2022-01-11 03:30:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2022-01-11 03:30:42,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:42,035 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:42,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-11 03:30:42,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:42,245 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:42,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash -847101343, now seen corresponding path program 1 times [2022-01-11 03:30:42,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:42,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866116909] [2022-01-11 03:30:42,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:42,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-01-11 03:30:42,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:42,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866116909] [2022-01-11 03:30:42,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866116909] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:42,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113845389] [2022-01-11 03:30:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:42,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:42,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:42,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:30:42,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-11 03:30:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:42,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 3653 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:42,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-01-11 03:30:43,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-01-11 03:30:44,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113845389] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:44,990 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:44,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:44,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378382189] [2022-01-11 03:30:44,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:44,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:44,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:44,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:44,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:44,992 INFO L87 Difference]: Start difference. First operand 2451 states and 3179 transitions. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:45,313 INFO L93 Difference]: Finished difference Result 4333 states and 5688 transitions. [2022-01-11 03:30:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 03:30:45,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 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 1015 [2022-01-11 03:30:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:45,314 INFO L225 Difference]: With dead ends: 4333 [2022-01-11 03:30:45,314 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:30:45,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2038 GetRequests, 2031 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-11 03:30:45,319 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 217 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:45,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 818 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:30:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:30:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:30:45,320 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-11 03:30:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:30:45,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1015 [2022-01-11 03:30:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:45,320 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:30:45,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:30:45,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:30:45,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:30:45,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-11 03:30:45,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:45,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:30:49,303 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:30:49,303 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:30:49,303 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-11 03:30:49,303 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-01-11 03:30:49,303 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-01-11 03:30:49,303 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-01-11 03:30:49,303 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-01-11 03:30:49,303 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 644) no Hoare annotation was computed. [2022-01-11 03:30:49,303 INFO L861 garLoopResultBuilder]: At program point L643(lines 22 645) the Hoare annotation is: true [2022-01-11 03:30:49,303 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 632) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse4 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse5 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse6 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and .cse0 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse0) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse2 .cse4) (and .cse1 .cse2 .cse4 .cse5) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3) (and .cse1 .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse6 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse1 .cse6) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-11 03:30:49,304 INFO L861 garLoopResultBuilder]: At program point L655(lines 646 657) the Hoare annotation is: true [2022-01-11 03:30:49,304 INFO L861 garLoopResultBuilder]: At program point L633(lines 109 634) the Hoare annotation is: true [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L638(lines 638 640) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 613) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L638-2(lines 638 640) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 613) the Hoare annotation is: (let ((.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse0 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse0) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0) (and .cse1 .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)))) [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 612) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 612) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse0 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)))) (or (and .cse0 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 611) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 610) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 609) no Hoare annotation was computed. [2022-01-11 03:30:49,304 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 608) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 608) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 607) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 576) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 606) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L854 garLoopResultBuilder]: At program point L577(lines 110 632) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse4 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse5 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse6 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and .cse0 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse0) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse2 .cse4) (and .cse1 .cse2 .cse4 .cse5) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3) (and .cse1 .cse0) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse6 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse1 .cse6) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-11 03:30:49,305 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 606) the Hoare annotation is: (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 605) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L615(lines 615 629) no Hoare annotation was computed. [2022-01-11 03:30:49,305 INFO L858 garLoopResultBuilder]: For program point L614(lines 614 630) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 605) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 604) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L616(lines 616 621) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 603) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L618(lines 618 620) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L616-2(lines 615 629) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 576) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 602) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L623(lines 623 627) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 602) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2))) [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 601) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 600) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 576) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 600) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2))) [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 599) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-01-11 03:30:49,306 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 598) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 598) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2))) [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 597) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 596) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 219 576) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 596) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2))) [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 595) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L854 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2))) [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 594) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2022-01-11 03:30:49,307 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2))) [2022-01-11 03:30:49,308 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 594) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2))) [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 593) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 592) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L854 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse2))) [2022-01-11 03:30:49,308 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 592) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (.cse0 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse2 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) .cse1) (and .cse0 .cse3 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse3 .cse1) (and .cse0 .cse2 .cse1))) [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 591) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2022-01-11 03:30:49,308 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 591) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse2 .cse3 .cse1) (and .cse2 .cse3 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse2 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse3))) [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 590) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 589) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 589) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse2 .cse3 .cse1) (and .cse2 .cse3 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse2 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse3))) [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 588) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 587) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 587) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse2 .cse3 .cse1) (and .cse2 .cse3 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse2 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse3))) [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 586) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 585) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 585) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse2 .cse3 .cse1) (and .cse2 .cse3 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse2 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse3))) [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 584) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 496) no Hoare annotation was computed. [2022-01-11 03:30:49,309 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 583) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L489-2(lines 219 576) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L489(lines 489 495) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 583) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse4 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse0 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse4 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse0 .cse2) (and .cse0 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 .cse1 .cse5 .cse2))) [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 582) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L500(lines 500 504) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L492(lines 492 494) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 513) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 581) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L500-2(lines 500 504) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L854 garLoopResultBuilder]: At program point L493(lines 83 644) the Hoare annotation is: false [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L515(lines 515 525) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 581) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse4 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse0 (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse1 (= 7 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int|) .cse0) (and .cse1 .cse2 .cse0) (and .cse1 .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 4)) (and .cse3 .cse2 .cse0) (and .cse1 .cse0 .cse4) (and .cse3 .cse0 .cse4) (and .cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 6) .cse0))) [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 580) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 642) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L521-2(lines 219 576) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 524) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L539(lines 539 549) no Hoare annotation was computed. [2022-01-11 03:30:49,310 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 579) no Hoare annotation was computed. [2022-01-11 03:30:49,311 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 534) no Hoare annotation was computed. [2022-01-11 03:30:49,311 INFO L858 garLoopResultBuilder]: For program point L521(lines 521 523) no Hoare annotation was computed. [2022-01-11 03:30:49,311 INFO L858 garLoopResultBuilder]: For program point L545-2(lines 219 576) no Hoare annotation was computed. [2022-01-11 03:30:49,311 INFO L858 garLoopResultBuilder]: For program point L542(lines 542 548) no Hoare annotation was computed. [2022-01-11 03:30:49,311 INFO L861 garLoopResultBuilder]: At program point L216(lines 215 579) the Hoare annotation is: true [2022-01-11 03:30:49,311 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 579) the Hoare annotation is: true [2022-01-11 03:30:49,311 INFO L858 garLoopResultBuilder]: For program point L554(lines 554 558) no Hoare annotation was computed. [2022-01-11 03:30:49,311 INFO L858 garLoopResultBuilder]: For program point L545(lines 545 547) no Hoare annotation was computed. [2022-01-11 03:30:49,311 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 570) no Hoare annotation was computed. [2022-01-11 03:30:49,311 INFO L858 garLoopResultBuilder]: For program point L554-2(lines 554 558) no Hoare annotation was computed. [2022-01-11 03:30:49,311 INFO L858 garLoopResultBuilder]: For program point L567(lines 567 569) no Hoare annotation was computed. [2022-01-11 03:30:49,311 INFO L858 garLoopResultBuilder]: For program point L564-1(lines 564 570) no Hoare annotation was computed. [2022-01-11 03:30:49,313 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, 1] [2022-01-11 03:30:49,314 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:30:49,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:49 BasicIcfg [2022-01-11 03:30:49,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:30:49,343 INFO L158 Benchmark]: Toolchain (without parser) took 22788.24ms. Allocated memory was 247.5MB in the beginning and 678.4MB in the end (delta: 431.0MB). Free memory was 190.6MB in the beginning and 396.0MB in the end (delta: -205.3MB). Peak memory consumption was 387.6MB. Max. memory is 8.0GB. [2022-01-11 03:30:49,344 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 247.5MB. Free memory is still 208.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:30:49,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.28ms. Allocated memory was 247.5MB in the beginning and 343.9MB in the end (delta: 96.5MB). Free memory was 190.4MB in the beginning and 310.8MB in the end (delta: -120.4MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-01-11 03:30:49,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.07ms. Allocated memory is still 343.9MB. Free memory was 310.8MB in the beginning and 307.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:49,344 INFO L158 Benchmark]: Boogie Preprocessor took 40.39ms. Allocated memory is still 343.9MB. Free memory was 307.7MB in the beginning and 305.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:49,344 INFO L158 Benchmark]: RCFGBuilder took 564.36ms. Allocated memory is still 343.9MB. Free memory was 305.6MB in the beginning and 276.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-01-11 03:30:49,344 INFO L158 Benchmark]: IcfgTransformer took 156.79ms. Allocated memory is still 343.9MB. Free memory was 276.2MB in the beginning and 261.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-11 03:30:49,345 INFO L158 Benchmark]: TraceAbstraction took 21626.32ms. Allocated memory was 343.9MB in the beginning and 678.4MB in the end (delta: 334.5MB). Free memory was 261.0MB in the beginning and 396.0MB in the end (delta: -135.0MB). Peak memory consumption was 361.5MB. Max. memory is 8.0GB. [2022-01-11 03:30:49,346 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 247.5MB. Free memory is still 208.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 341.28ms. Allocated memory was 247.5MB in the beginning and 343.9MB in the end (delta: 96.5MB). Free memory was 190.4MB in the beginning and 310.8MB in the end (delta: -120.4MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.07ms. Allocated memory is still 343.9MB. Free memory was 310.8MB in the beginning and 307.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.39ms. Allocated memory is still 343.9MB. Free memory was 307.7MB in the beginning and 305.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 564.36ms. Allocated memory is still 343.9MB. Free memory was 305.6MB in the beginning and 276.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * IcfgTransformer took 156.79ms. Allocated memory is still 343.9MB. Free memory was 276.2MB in the beginning and 261.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 21626.32ms. Allocated memory was 343.9MB in the beginning and 678.4MB in the end (delta: 334.5MB). Free memory was 261.0MB in the beginning and 396.0MB in the end (delta: -135.0MB). Peak memory consumption was 361.5MB. 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: 642]: 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, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 24, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2434 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2434 mSDsluCounter, 10158 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4112 mSDsCounter, 558 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2643 IncrementalHoareTripleChecker+Invalid, 3201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 558 mSolverCounterUnsat, 6046 mSDtfsCounter, 2643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5735 GetRequests, 5688 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3215occurred in iteration=15, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 2066 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 392 NumberOfFragments, 1237 HoareAnnotationTreeSize, 28 FomulaSimplifications, 8182 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 28 FomulaSimplificationsInter, 11941 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 11563 NumberOfCodeBlocks, 11563 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 13140 ConstructedInterpolants, 0 QuantifiedInterpolants, 21656 SizeOfPredicates, 3 NumberOfNonLiveVariables, 14913 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 33 InterpolantComputations, 22 PerfectInterpolantSequences, 93357/93643 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: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 646]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((blastFlag == 3bv32 && ~bvule32(8656bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32)) || ((~bvule32(blastFlag, 0bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (((!(s__hit == 0bv32) && blastFlag == 6bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (((!(s__hit == 0bv32) && blastFlag == 3bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (((!(s__hit == 0bv32) && ~bvule32(8656bv32, s__state)) && blastFlag == 4bv32) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag == 3bv32 && ~bvule32(8656bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32)) || (~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state)) || ~bvule32(s__state, 3bv32)) || ((~bvule32(s__s3__tmp__next_state___0, 3bv32) && 8448bv32 == s__state) && blastFlag == 4bv32)) || ~bvule32(blastFlag, 0bv32)) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || (((!(s__hit == 0bv32) && blastFlag == 6bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 4bv32)) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (((!(s__hit == 0bv32) && blastFlag == 3bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32))) || (!(s__hit == 0bv32) && blastFlag == 7bv32)) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 0bv32) || (!(s__hit == 0bv32) && blastFlag == 4bv32)) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32))) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32))) || (!(s__hit == 0bv32) && blastFlag == 7bv32) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((!(s__hit == 0bv32) && ~bvule32(8656bv32, s__state)) && blastFlag == 4bv32) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8656bv32, s__state))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8656bv32, s__state))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(8656bv32, s__state)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((~bvule32(blastFlag, 0bv32) && 8448bv32 == s__state) || ((~bvule32(s__s3__tmp__next_state___0, 3bv32) && 8448bv32 == s__state) && blastFlag == 4bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && 8448bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && 8448bv32 == s__state)) || ((!(s__hit == 0bv32) && 8448bv32 == s__state) && blastFlag == 4bv32)) || ((~bvule32(blastFlag, 2bv32) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((!(s__hit == 0bv32) && ~bvule32(8656bv32, s__state)) && blastFlag == 4bv32) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(8656bv32, s__state))) || ((!(s__hit == 0bv32) && blastFlag == 6bv32) && ~bvule32(8656bv32, s__state))) || ((blastFlag == 3bv32 && ~bvule32(8656bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8656bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((!(s__hit == 0bv32) && blastFlag == 3bv32) && ~bvule32(8656bv32, s__state))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(8656bv32, s__state)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag == 3bv32 && ~bvule32(8656bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32)) || (~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state)) || ~bvule32(s__state, 3bv32)) || ((~bvule32(s__s3__tmp__next_state___0, 3bv32) && 8448bv32 == s__state) && blastFlag == 4bv32)) || ~bvule32(blastFlag, 0bv32)) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || (((!(s__hit == 0bv32) && blastFlag == 6bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 4bv32)) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (((!(s__hit == 0bv32) && blastFlag == 3bv32) && ~bvule32(8656bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32))) || (!(s__hit == 0bv32) && blastFlag == 7bv32)) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && blastFlag == 4bv32) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 8656bv32))) || ((!(s__hit == 0bv32) && blastFlag == 7bv32) && ~bvule32(s__state, 8656bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-11 03:30:49,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...