/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_LAZY.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 15:52:14,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 15:52:14,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 15:52:14,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 15:52:14,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 15:52:14,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 15:52:14,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 15:52:14,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 15:52:14,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 15:52:14,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 15:52:14,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 15:52:14,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 15:52:14,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 15:52:14,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 15:52:14,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 15:52:14,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 15:52:14,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 15:52:14,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 15:52:14,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 15:52:14,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 15:52:14,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 15:52:14,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 15:52:14,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 15:52:14,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 15:52:14,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 15:52:14,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 15:52:14,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 15:52:14,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 15:52:14,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 15:52:14,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 15:52:14,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 15:52:14,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 15:52:14,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 15:52:14,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 15:52:14,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 15:52:14,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 15:52:14,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 15:52:14,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 15:52:14,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 15:52:14,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 15:52:14,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 15:52:14,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 15:52:14,335 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 15:52:14,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 15:52:14,336 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 15:52:14,336 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 15:52:14,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 15:52:14,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 15:52:14,337 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 15:52:14,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 15:52:14,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 15:52:14,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 15:52:14,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 15:52:14,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 15:52:14,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 15:52:14,338 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 15:52:14,338 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 15:52:14,338 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 15:52:14,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 15:52:14,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 15:52:14,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 15:52:14,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 15:52:14,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 15:52:14,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:52:14,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 15:52:14,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 15:52:14,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 15:52:14,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 15:52:14,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 15:52:14,340 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 15:52:14,340 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 15:52:14,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 15:52:14,340 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 15:52:14,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 15:52:14,341 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 15:52:14,341 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 15:52:14,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 15:52:14,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 15:52:14,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 15:52:14,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 15:52:14,602 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 15:52:14,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-1.c [2022-01-10 15:52:14,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956ce6457/022894ba4ec6441ebfecfe63c250393c/FLAG331a34923 [2022-01-10 15:52:15,018 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 15:52:15,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-1.c [2022-01-10 15:52:15,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956ce6457/022894ba4ec6441ebfecfe63c250393c/FLAG331a34923 [2022-01-10 15:52:15,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956ce6457/022894ba4ec6441ebfecfe63c250393c [2022-01-10 15:52:15,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 15:52:15,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 15:52:15,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 15:52:15,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 15:52:15,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 15:52:15,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45598e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15, skipping insertion in model container [2022-01-10 15:52:15,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 15:52:15,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:52:15,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-1.c[37413,37426] [2022-01-10 15:52:15,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:52:15,307 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 15:52:15,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-1.c[37413,37426] [2022-01-10 15:52:15,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:52:15,371 INFO L208 MainTranslator]: Completed translation [2022-01-10 15:52:15,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15 WrapperNode [2022-01-10 15:52:15,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 15:52:15,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 15:52:15,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 15:52:15,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 15:52:15,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,426 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 432 [2022-01-10 15:52:15,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 15:52:15,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 15:52:15,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 15:52:15,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 15:52:15,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 15:52:15,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 15:52:15,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 15:52:15,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 15:52:15,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:15,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:52:15,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:15,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 15:52:15,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 15:52:15,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 15:52:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 15:52:15,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 15:52:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 15:52:15,633 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 15:52:15,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 15:52:15,649 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:52:15,913 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-10 15:52:15,913 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-10 15:52:15,913 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 15:52:15,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 15:52:15,918 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 15:52:15,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:15 BoogieIcfgContainer [2022-01-10 15:52:15,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 15:52:15,920 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 15:52:15,920 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 15:52:15,921 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 15:52:15,923 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:15" (1/1) ... [2022-01-10 15:52:16,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:52:16 BasicIcfg [2022-01-10 15:52:16,114 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 15:52:16,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 15:52:16,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 15:52:16,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 15:52:16,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:52:15" (1/4) ... [2022-01-10 15:52:16,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2308193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:52:16, skipping insertion in model container [2022-01-10 15:52:16,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:15" (2/4) ... [2022-01-10 15:52:16,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2308193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:52:16, skipping insertion in model container [2022-01-10 15:52:16,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:15" (3/4) ... [2022-01-10 15:52:16,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2308193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:52:16, skipping insertion in model container [2022-01-10 15:52:16,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:52:16" (4/4) ... [2022-01-10 15:52:16,119 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.cTransformedIcfg [2022-01-10 15:52:16,122 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 15:52:16,122 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 15:52:16,157 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 15:52:16,162 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 15:52:16,162 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 15:52:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 123 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 15:52:16,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:16,180 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:16,181 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash 258215262, now seen corresponding path program 1 times [2022-01-10 15:52:16,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:16,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499467283] [2022-01-10 15:52:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:16,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:52:16,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:16,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499467283] [2022-01-10 15:52:16,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499467283] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:16,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:16,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:16,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49696415] [2022-01-10 15:52:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:16,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:16,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:16,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:16,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:16,434 INFO L87 Difference]: Start difference. First operand has 124 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 123 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:16,512 INFO L93 Difference]: Finished difference Result 354 states and 608 transitions. [2022-01-10 15:52:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 15:52:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:16,526 INFO L225 Difference]: With dead ends: 354 [2022-01-10 15:52:16,526 INFO L226 Difference]: Without dead ends: 207 [2022-01-10 15:52:16,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:16,531 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 175 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:16,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 390 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-01-10 15:52:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-01-10 15:52:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.5097087378640777) internal successors, (311), 206 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 311 transitions. [2022-01-10 15:52:16,574 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 311 transitions. Word has length 24 [2022-01-10 15:52:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:16,574 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 311 transitions. [2022-01-10 15:52:16,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 311 transitions. [2022-01-10 15:52:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 15:52:16,576 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:16,576 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:16,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 15:52:16,576 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:16,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:16,577 INFO L85 PathProgramCache]: Analyzing trace with hash -145118534, now seen corresponding path program 1 times [2022-01-10 15:52:16,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:16,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574245953] [2022-01-10 15:52:16,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:16,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:52:16,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:16,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574245953] [2022-01-10 15:52:16,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574245953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:16,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:16,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:16,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220436948] [2022-01-10 15:52:16,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:16,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:16,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:16,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:16,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:16,634 INFO L87 Difference]: Start difference. First operand 207 states and 311 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:18,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:18,802 INFO L93 Difference]: Finished difference Result 336 states and 510 transitions. [2022-01-10 15:52:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:18,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-10 15:52:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:18,803 INFO L225 Difference]: With dead ends: 336 [2022-01-10 15:52:18,804 INFO L226 Difference]: Without dead ends: 234 [2022-01-10 15:52:18,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:18,805 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 16 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:18,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 254 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:52:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-01-10 15:52:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 224. [2022-01-10 15:52:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.493273542600897) internal successors, (333), 223 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 333 transitions. [2022-01-10 15:52:18,815 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 333 transitions. Word has length 38 [2022-01-10 15:52:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:18,816 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 333 transitions. [2022-01-10 15:52:18,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 333 transitions. [2022-01-10 15:52:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 15:52:18,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:18,817 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:18,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 15:52:18,818 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 670100932, now seen corresponding path program 1 times [2022-01-10 15:52:18,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:18,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976197891] [2022-01-10 15:52:18,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:18,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 15:52:18,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:18,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976197891] [2022-01-10 15:52:18,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976197891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:18,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:18,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:18,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150979808] [2022-01-10 15:52:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:18,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:18,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:18,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:18,876 INFO L87 Difference]: Start difference. First operand 224 states and 333 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:20,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:21,044 INFO L93 Difference]: Finished difference Result 489 states and 736 transitions. [2022-01-10 15:52:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:21,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-10 15:52:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:21,046 INFO L225 Difference]: With dead ends: 489 [2022-01-10 15:52:21,046 INFO L226 Difference]: Without dead ends: 272 [2022-01-10 15:52:21,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:21,047 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:21,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 256 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:52:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-01-10 15:52:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2022-01-10 15:52:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.456273764258555) internal successors, (383), 263 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 383 transitions. [2022-01-10 15:52:21,056 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 383 transitions. Word has length 55 [2022-01-10 15:52:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:21,056 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 383 transitions. [2022-01-10 15:52:21,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 383 transitions. [2022-01-10 15:52:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 15:52:21,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:21,058 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:21,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 15:52:21,058 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:21,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash -574663549, now seen corresponding path program 1 times [2022-01-10 15:52:21,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:21,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581861175] [2022-01-10 15:52:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:21,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 15:52:21,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:21,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581861175] [2022-01-10 15:52:21,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581861175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:21,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:21,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:21,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599123314] [2022-01-10 15:52:21,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:21,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:21,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:21,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:21,105 INFO L87 Difference]: Start difference. First operand 264 states and 383 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:23,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:23,295 INFO L93 Difference]: Finished difference Result 619 states and 929 transitions. [2022-01-10 15:52:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:23,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-10 15:52:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:23,297 INFO L225 Difference]: With dead ends: 619 [2022-01-10 15:52:23,297 INFO L226 Difference]: Without dead ends: 360 [2022-01-10 15:52:23,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:23,298 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 52 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:23,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 218 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:52:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-01-10 15:52:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 344. [2022-01-10 15:52:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.402332361516035) internal successors, (481), 343 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2022-01-10 15:52:23,313 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 55 [2022-01-10 15:52:23,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:23,314 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2022-01-10 15:52:23,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2022-01-10 15:52:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-10 15:52:23,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:23,316 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:23,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 15:52:23,316 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1698517373, now seen corresponding path program 1 times [2022-01-10 15:52:23,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:23,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128689] [2022-01-10 15:52:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:23,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 15:52:23,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:23,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128689] [2022-01-10 15:52:23,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:23,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:23,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:23,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859165947] [2022-01-10 15:52:23,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:23,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:23,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:23,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:23,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:23,400 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:23,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:23,536 INFO L93 Difference]: Finished difference Result 818 states and 1170 transitions. [2022-01-10 15:52:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:23,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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-10 15:52:23,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:23,538 INFO L225 Difference]: With dead ends: 818 [2022-01-10 15:52:23,538 INFO L226 Difference]: Without dead ends: 479 [2022-01-10 15:52:23,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:23,539 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 124 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:23,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 169 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-01-10 15:52:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 455. [2022-01-10 15:52:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.4361233480176212) internal successors, (652), 454 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 652 transitions. [2022-01-10 15:52:23,549 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 652 transitions. Word has length 79 [2022-01-10 15:52:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:23,550 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 652 transitions. [2022-01-10 15:52:23,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 652 transitions. [2022-01-10 15:52:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 15:52:23,551 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:23,552 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:23,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 15:52:23,552 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1439681457, now seen corresponding path program 1 times [2022-01-10 15:52:23,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:23,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242415464] [2022-01-10 15:52:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:23,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-10 15:52:23,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:23,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242415464] [2022-01-10 15:52:23,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242415464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:23,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:23,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:23,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218320704] [2022-01-10 15:52:23,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:23,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:23,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:23,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:23,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:23,625 INFO L87 Difference]: Start difference. First operand 455 states and 652 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:25,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:25,833 INFO L93 Difference]: Finished difference Result 918 states and 1333 transitions. [2022-01-10 15:52:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:25,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 83 [2022-01-10 15:52:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:25,837 INFO L225 Difference]: With dead ends: 918 [2022-01-10 15:52:25,837 INFO L226 Difference]: Without dead ends: 503 [2022-01-10 15:52:25,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:25,838 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:25,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 256 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 99 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:52:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-01-10 15:52:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 497. [2022-01-10 15:52:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4193548387096775) internal successors, (704), 496 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 704 transitions. [2022-01-10 15:52:25,847 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 704 transitions. Word has length 83 [2022-01-10 15:52:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:25,847 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 704 transitions. [2022-01-10 15:52:25,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 704 transitions. [2022-01-10 15:52:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 15:52:25,848 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:25,849 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:25,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 15:52:25,849 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:25,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1710074549, now seen corresponding path program 1 times [2022-01-10 15:52:25,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:25,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864828054] [2022-01-10 15:52:25,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:25,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 15:52:25,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:25,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864828054] [2022-01-10 15:52:25,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864828054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:25,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:25,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:25,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920883974] [2022-01-10 15:52:25,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:25,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:25,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:25,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:25,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:25,935 INFO L87 Difference]: Start difference. First operand 497 states and 704 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:25,988 INFO L93 Difference]: Finished difference Result 973 states and 1391 transitions. [2022-01-10 15:52:25,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:25,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-10 15:52:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:25,991 INFO L225 Difference]: With dead ends: 973 [2022-01-10 15:52:25,991 INFO L226 Difference]: Without dead ends: 734 [2022-01-10 15:52:25,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:25,992 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 134 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:25,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 301 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-01-10 15:52:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2022-01-10 15:52:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.4242837653478855) internal successors, (1044), 733 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1044 transitions. [2022-01-10 15:52:26,025 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1044 transitions. Word has length 103 [2022-01-10 15:52:26,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:26,026 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1044 transitions. [2022-01-10 15:52:26,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1044 transitions. [2022-01-10 15:52:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 15:52:26,027 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:26,027 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:26,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 15:52:26,027 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:26,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash 851213822, now seen corresponding path program 1 times [2022-01-10 15:52:26,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:26,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057075393] [2022-01-10 15:52:26,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:26,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-10 15:52:26,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:26,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057075393] [2022-01-10 15:52:26,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057075393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:26,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:26,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:26,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788524988] [2022-01-10 15:52:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:26,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:26,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:26,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:26,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:26,071 INFO L87 Difference]: Start difference. First operand 734 states and 1044 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:26,102 INFO L93 Difference]: Finished difference Result 973 states and 1388 transitions. [2022-01-10 15:52:26,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:26,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-10 15:52:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:26,106 INFO L225 Difference]: With dead ends: 973 [2022-01-10 15:52:26,106 INFO L226 Difference]: Without dead ends: 971 [2022-01-10 15:52:26,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:26,107 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 136 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:26,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 299 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-01-10 15:52:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2022-01-10 15:52:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.4288659793814433) internal successors, (1386), 970 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1386 transitions. [2022-01-10 15:52:26,126 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1386 transitions. Word has length 105 [2022-01-10 15:52:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:26,126 INFO L470 AbstractCegarLoop]: Abstraction has 971 states and 1386 transitions. [2022-01-10 15:52:26,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1386 transitions. [2022-01-10 15:52:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 15:52:26,128 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:26,128 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:26,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 15:52:26,128 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash 939181828, now seen corresponding path program 1 times [2022-01-10 15:52:26,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:26,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687805463] [2022-01-10 15:52:26,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:26,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-10 15:52:26,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:26,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687805463] [2022-01-10 15:52:26,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687805463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:26,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:26,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:26,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774539291] [2022-01-10 15:52:26,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:26,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:26,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:26,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:26,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:26,177 INFO L87 Difference]: Start difference. First operand 971 states and 1386 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:28,278 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:28,415 INFO L93 Difference]: Finished difference Result 2102 states and 3060 transitions. [2022-01-10 15:52:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:28,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 159 [2022-01-10 15:52:28,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:28,419 INFO L225 Difference]: With dead ends: 2102 [2022-01-10 15:52:28,419 INFO L226 Difference]: Without dead ends: 1163 [2022-01-10 15:52:28,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:28,420 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 78 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:28,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 200 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 109 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:52:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-01-10 15:52:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1127. [2022-01-10 15:52:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 1.4440497335701599) internal successors, (1626), 1126 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:28,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1626 transitions. [2022-01-10 15:52:28,441 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1626 transitions. Word has length 159 [2022-01-10 15:52:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:28,441 INFO L470 AbstractCegarLoop]: Abstraction has 1127 states and 1626 transitions. [2022-01-10 15:52:28,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1626 transitions. [2022-01-10 15:52:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-01-10 15:52:28,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:28,444 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:28,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 15:52:28,444 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:28,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash 302772068, now seen corresponding path program 1 times [2022-01-10 15:52:28,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:28,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547943752] [2022-01-10 15:52:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:28,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-01-10 15:52:28,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:28,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547943752] [2022-01-10 15:52:28,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547943752] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:28,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:28,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:28,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593951630] [2022-01-10 15:52:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:28,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:28,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:28,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:28,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:28,513 INFO L87 Difference]: Start difference. First operand 1127 states and 1626 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:30,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:30,718 INFO L93 Difference]: Finished difference Result 2320 states and 3334 transitions. [2022-01-10 15:52:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:30,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2022-01-10 15:52:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:30,722 INFO L225 Difference]: With dead ends: 2320 [2022-01-10 15:52:30,722 INFO L226 Difference]: Without dead ends: 1233 [2022-01-10 15:52:30,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:30,724 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 13 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:30,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 255 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:52:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2022-01-10 15:52:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1219. [2022-01-10 15:52:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 1.4269293924466337) internal successors, (1738), 1218 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1738 transitions. [2022-01-10 15:52:30,743 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1738 transitions. Word has length 195 [2022-01-10 15:52:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:30,743 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 1738 transitions. [2022-01-10 15:52:30,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1738 transitions. [2022-01-10 15:52:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-01-10 15:52:30,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:30,747 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:30,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 15:52:30,747 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:30,748 INFO L85 PathProgramCache]: Analyzing trace with hash -525245704, now seen corresponding path program 1 times [2022-01-10 15:52:30,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:30,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197686058] [2022-01-10 15:52:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:30,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-01-10 15:52:30,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:30,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197686058] [2022-01-10 15:52:30,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197686058] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:30,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:30,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:30,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10157081] [2022-01-10 15:52:30,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:30,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:30,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:30,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:30,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:30,810 INFO L87 Difference]: Start difference. First operand 1219 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:32,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:33,011 INFO L93 Difference]: Finished difference Result 2510 states and 3576 transitions. [2022-01-10 15:52:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:33,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 216 [2022-01-10 15:52:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:33,018 INFO L225 Difference]: With dead ends: 2510 [2022-01-10 15:52:33,018 INFO L226 Difference]: Without dead ends: 1331 [2022-01-10 15:52:33,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:33,020 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:33,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 256 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:52:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-01-10 15:52:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1319. [2022-01-10 15:52:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.409711684370258) internal successors, (1858), 1318 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1858 transitions. [2022-01-10 15:52:33,041 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1858 transitions. Word has length 216 [2022-01-10 15:52:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:33,042 INFO L470 AbstractCegarLoop]: Abstraction has 1319 states and 1858 transitions. [2022-01-10 15:52:33,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1858 transitions. [2022-01-10 15:52:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-01-10 15:52:33,044 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:33,044 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:33,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 15:52:33,045 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:33,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1705203955, now seen corresponding path program 1 times [2022-01-10 15:52:33,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:33,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89272919] [2022-01-10 15:52:33,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:33,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-10 15:52:33,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:33,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89272919] [2022-01-10 15:52:33,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89272919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:33,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:33,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:33,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182755927] [2022-01-10 15:52:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:33,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:33,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:33,108 INFO L87 Difference]: Start difference. First operand 1319 states and 1858 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:33,229 INFO L93 Difference]: Finished difference Result 2718 states and 3828 transitions. [2022-01-10 15:52:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:33,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2022-01-10 15:52:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:33,233 INFO L225 Difference]: With dead ends: 2718 [2022-01-10 15:52:33,234 INFO L226 Difference]: Without dead ends: 1439 [2022-01-10 15:52:33,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:33,235 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:33,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 256 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2022-01-10 15:52:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1431. [2022-01-10 15:52:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1430 states have (on average 1.3916083916083917) internal successors, (1990), 1430 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1990 transitions. [2022-01-10 15:52:33,281 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1990 transitions. Word has length 240 [2022-01-10 15:52:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:33,282 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 1990 transitions. [2022-01-10 15:52:33,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1990 transitions. [2022-01-10 15:52:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-01-10 15:52:33,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:33,285 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:33,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 15:52:33,285 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:33,285 INFO L85 PathProgramCache]: Analyzing trace with hash 421292788, now seen corresponding path program 1 times [2022-01-10 15:52:33,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:33,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661914035] [2022-01-10 15:52:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:33,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-10 15:52:33,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:33,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661914035] [2022-01-10 15:52:33,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661914035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:33,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:33,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:33,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452379728] [2022-01-10 15:52:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:33,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:33,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:33,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:33,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:33,356 INFO L87 Difference]: Start difference. First operand 1431 states and 1990 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:35,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:35,561 INFO L93 Difference]: Finished difference Result 2958 states and 4128 transitions. [2022-01-10 15:52:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:35,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2022-01-10 15:52:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:35,565 INFO L225 Difference]: With dead ends: 2958 [2022-01-10 15:52:35,565 INFO L226 Difference]: Without dead ends: 1567 [2022-01-10 15:52:35,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:35,568 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:35,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 257 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:52:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-01-10 15:52:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1555. [2022-01-10 15:52:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1554 states have (on average 1.3732303732303732) internal successors, (2134), 1554 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2134 transitions. [2022-01-10 15:52:35,594 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2134 transitions. Word has length 240 [2022-01-10 15:52:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:35,595 INFO L470 AbstractCegarLoop]: Abstraction has 1555 states and 2134 transitions. [2022-01-10 15:52:35,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2134 transitions. [2022-01-10 15:52:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-01-10 15:52:35,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:35,599 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:35,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 15:52:35,599 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:35,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1970271356, now seen corresponding path program 1 times [2022-01-10 15:52:35,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:35,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622261391] [2022-01-10 15:52:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:35,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-01-10 15:52:35,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:35,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622261391] [2022-01-10 15:52:35,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622261391] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:35,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:35,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:35,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411594896] [2022-01-10 15:52:35,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:35,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:35,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:35,666 INFO L87 Difference]: Start difference. First operand 1555 states and 2134 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:35,700 INFO L93 Difference]: Finished difference Result 4469 states and 6170 transitions. [2022-01-10 15:52:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:35,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2022-01-10 15:52:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:35,709 INFO L225 Difference]: With dead ends: 4469 [2022-01-10 15:52:35,709 INFO L226 Difference]: Without dead ends: 2954 [2022-01-10 15:52:35,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:35,712 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 123 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:35,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 475 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2022-01-10 15:52:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2022-01-10 15:52:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2952 states, 2951 states have (on average 1.3808878346323281) internal successors, (4075), 2951 states have internal predecessors, (4075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 4075 transitions. [2022-01-10 15:52:35,794 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 4075 transitions. Word has length 270 [2022-01-10 15:52:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:35,794 INFO L470 AbstractCegarLoop]: Abstraction has 2952 states and 4075 transitions. [2022-01-10 15:52:35,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 4075 transitions. [2022-01-10 15:52:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-01-10 15:52:35,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:35,800 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:35,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 15:52:35,800 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1040784773, now seen corresponding path program 1 times [2022-01-10 15:52:35,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:35,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129526561] [2022-01-10 15:52:35,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:35,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2022-01-10 15:52:35,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:35,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129526561] [2022-01-10 15:52:35,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129526561] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:35,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:35,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:35,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019528259] [2022-01-10 15:52:35,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:35,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:35,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:35,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:35,890 INFO L87 Difference]: Start difference. First operand 2952 states and 4075 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:36,038 INFO L93 Difference]: Finished difference Result 6164 states and 8546 transitions. [2022-01-10 15:52:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:36,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2022-01-10 15:52:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:36,047 INFO L225 Difference]: With dead ends: 6164 [2022-01-10 15:52:36,047 INFO L226 Difference]: Without dead ends: 3252 [2022-01-10 15:52:36,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:36,053 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:36,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 257 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2022-01-10 15:52:36,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 3236. [2022-01-10 15:52:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 3235 states have (on average 1.3598145285935086) internal successors, (4399), 3235 states have internal predecessors, (4399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4399 transitions. [2022-01-10 15:52:36,109 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4399 transitions. Word has length 270 [2022-01-10 15:52:36,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:36,109 INFO L470 AbstractCegarLoop]: Abstraction has 3236 states and 4399 transitions. [2022-01-10 15:52:36,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:36,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4399 transitions. [2022-01-10 15:52:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-01-10 15:52:36,116 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:36,116 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:36,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 15:52:36,116 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:36,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1279221950, now seen corresponding path program 1 times [2022-01-10 15:52:36,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:36,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491983158] [2022-01-10 15:52:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:36,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-01-10 15:52:36,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:36,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491983158] [2022-01-10 15:52:36,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491983158] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:36,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:36,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:36,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514315505] [2022-01-10 15:52:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:36,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:36,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:36,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:36,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:36,183 INFO L87 Difference]: Start difference. First operand 3236 states and 4399 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:38,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:38,410 INFO L93 Difference]: Finished difference Result 6580 states and 8962 transitions. [2022-01-10 15:52:38,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:38,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 294 [2022-01-10 15:52:38,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:38,419 INFO L225 Difference]: With dead ends: 6580 [2022-01-10 15:52:38,436 INFO L226 Difference]: Without dead ends: 3384 [2022-01-10 15:52:38,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:38,438 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:38,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 256 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:52:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2022-01-10 15:52:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3368. [2022-01-10 15:52:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.3516483516483517) internal successors, (4551), 3367 states have internal predecessors, (4551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4551 transitions. [2022-01-10 15:52:38,484 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4551 transitions. Word has length 294 [2022-01-10 15:52:38,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:38,485 INFO L470 AbstractCegarLoop]: Abstraction has 3368 states and 4551 transitions. [2022-01-10 15:52:38,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4551 transitions. [2022-01-10 15:52:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-01-10 15:52:38,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:38,490 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:38,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 15:52:38,490 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:38,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1717991461, now seen corresponding path program 1 times [2022-01-10 15:52:38,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:38,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888428051] [2022-01-10 15:52:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:38,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 15:52:38,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:38,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888428051] [2022-01-10 15:52:38,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888428051] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:38,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:38,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:38,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366443409] [2022-01-10 15:52:38,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:38,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:38,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:38,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:38,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:38,569 INFO L87 Difference]: Start difference. First operand 3368 states and 4551 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:38,746 INFO L93 Difference]: Finished difference Result 7088 states and 9718 transitions. [2022-01-10 15:52:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:38,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 305 [2022-01-10 15:52:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:38,755 INFO L225 Difference]: With dead ends: 7088 [2022-01-10 15:52:38,755 INFO L226 Difference]: Without dead ends: 3760 [2022-01-10 15:52:38,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:38,760 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 48 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:38,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 250 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-01-10 15:52:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3680. [2022-01-10 15:52:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3679 states have (on average 1.337048110899701) internal successors, (4919), 3679 states have internal predecessors, (4919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 4919 transitions. [2022-01-10 15:52:38,810 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 4919 transitions. Word has length 305 [2022-01-10 15:52:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:38,810 INFO L470 AbstractCegarLoop]: Abstraction has 3680 states and 4919 transitions. [2022-01-10 15:52:38,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 4919 transitions. [2022-01-10 15:52:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2022-01-10 15:52:38,815 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:38,815 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:38,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 15:52:38,816 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash -337211326, now seen corresponding path program 1 times [2022-01-10 15:52:38,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:38,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488743211] [2022-01-10 15:52:38,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:38,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 625 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 15:52:38,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488743211] [2022-01-10 15:52:38,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488743211] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:38,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:38,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:38,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684790047] [2022-01-10 15:52:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:38,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:38,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:38,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:38,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:38,890 INFO L87 Difference]: Start difference. First operand 3680 states and 4919 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:39,066 INFO L93 Difference]: Finished difference Result 7720 states and 10262 transitions. [2022-01-10 15:52:39,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:39,067 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 318 [2022-01-10 15:52:39,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:39,087 INFO L225 Difference]: With dead ends: 7720 [2022-01-10 15:52:39,087 INFO L226 Difference]: Without dead ends: 4080 [2022-01-10 15:52:39,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:39,094 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 133 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:39,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 135 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2022-01-10 15:52:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 3800. [2022-01-10 15:52:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3800 states, 3799 states have (on average 1.3327191366148987) internal successors, (5063), 3799 states have internal predecessors, (5063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 5063 transitions. [2022-01-10 15:52:39,158 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 5063 transitions. Word has length 318 [2022-01-10 15:52:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:39,159 INFO L470 AbstractCegarLoop]: Abstraction has 3800 states and 5063 transitions. [2022-01-10 15:52:39,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 5063 transitions. [2022-01-10 15:52:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2022-01-10 15:52:39,165 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:39,165 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 15:52:39,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 15:52:39,166 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash 119047739, now seen corresponding path program 1 times [2022-01-10 15:52:39,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:39,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718723692] [2022-01-10 15:52:39,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:39,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 772 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2022-01-10 15:52:39,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:39,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718723692] [2022-01-10 15:52:39,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718723692] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:39,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:39,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:39,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473307212] [2022-01-10 15:52:39,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:39,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:39,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:39,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:39,243 INFO L87 Difference]: Start difference. First operand 3800 states and 5063 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:39,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:39,287 INFO L93 Difference]: Finished difference Result 10816 states and 14501 transitions. [2022-01-10 15:52:39,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:39,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 319 [2022-01-10 15:52:39,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:39,298 INFO L225 Difference]: With dead ends: 10816 [2022-01-10 15:52:39,298 INFO L226 Difference]: Without dead ends: 7056 [2022-01-10 15:52:39,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:39,302 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 82 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:39,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 462 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7056 states. [2022-01-10 15:52:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7056 to 7054. [2022-01-10 15:52:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7054 states, 7053 states have (on average 1.3414150007089183) internal successors, (9461), 7053 states have internal predecessors, (9461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 9461 transitions. [2022-01-10 15:52:39,407 INFO L78 Accepts]: Start accepts. Automaton has 7054 states and 9461 transitions. Word has length 319 [2022-01-10 15:52:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:39,407 INFO L470 AbstractCegarLoop]: Abstraction has 7054 states and 9461 transitions. [2022-01-10 15:52:39,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7054 states and 9461 transitions. [2022-01-10 15:52:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2022-01-10 15:52:39,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:39,414 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:39,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 15:52:39,414 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:39,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1617596952, now seen corresponding path program 1 times [2022-01-10 15:52:39,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:39,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989820936] [2022-01-10 15:52:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:39,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 746 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-01-10 15:52:39,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989820936] [2022-01-10 15:52:39,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989820936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:39,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:39,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:39,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071410747] [2022-01-10 15:52:39,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:39,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:39,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:39,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:39,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:39,471 INFO L87 Difference]: Start difference. First operand 7054 states and 9461 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:41,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:43,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:43,783 INFO L93 Difference]: Finished difference Result 14076 states and 18866 transitions. [2022-01-10 15:52:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:43,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2022-01-10 15:52:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:43,794 INFO L225 Difference]: With dead ends: 14076 [2022-01-10 15:52:43,794 INFO L226 Difference]: Without dead ends: 7062 [2022-01-10 15:52:43,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:43,801 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 11 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:43,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 252 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 115 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-01-10 15:52:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2022-01-10 15:52:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 7030. [2022-01-10 15:52:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7030 states, 7029 states have (on average 1.3061601934841371) internal successors, (9181), 7029 states have internal predecessors, (9181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 9181 transitions. [2022-01-10 15:52:43,943 INFO L78 Accepts]: Start accepts. Automaton has 7030 states and 9181 transitions. Word has length 320 [2022-01-10 15:52:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:43,944 INFO L470 AbstractCegarLoop]: Abstraction has 7030 states and 9181 transitions. [2022-01-10 15:52:43,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 7030 states and 9181 transitions. [2022-01-10 15:52:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2022-01-10 15:52:43,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:43,951 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:43,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 15:52:43,951 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:43,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:43,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1913882228, now seen corresponding path program 1 times [2022-01-10 15:52:43,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:43,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902236019] [2022-01-10 15:52:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:43,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 15:52:44,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:44,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902236019] [2022-01-10 15:52:44,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902236019] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:44,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999265403] [2022-01-10 15:52:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:44,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:44,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:44,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:52:44,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 15:52:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:44,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:44,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 15:52:44,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:52:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 15:52:45,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999265403] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:52:45,333 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:52:45,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 15:52:45,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108097044] [2022-01-10 15:52:45,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:52:45,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 15:52:45,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:45,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 15:52:45,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 15:52:45,336 INFO L87 Difference]: Start difference. First operand 7030 states and 9181 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:47,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:49,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:49,973 INFO L93 Difference]: Finished difference Result 14046 states and 18353 transitions. [2022-01-10 15:52:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 15:52:49,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 343 [2022-01-10 15:52:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:50,018 INFO L225 Difference]: With dead ends: 14046 [2022-01-10 15:52:50,019 INFO L226 Difference]: Without dead ends: 10630 [2022-01-10 15:52:50,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-10 15:52:50,025 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 350 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:50,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 738 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-01-10 15:52:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10630 states. [2022-01-10 15:52:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10630 to 8118. [2022-01-10 15:52:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8118 states, 8117 states have (on average 1.31341628680547) internal successors, (10661), 8117 states have internal predecessors, (10661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8118 states to 8118 states and 10661 transitions. [2022-01-10 15:52:50,237 INFO L78 Accepts]: Start accepts. Automaton has 8118 states and 10661 transitions. Word has length 343 [2022-01-10 15:52:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:50,238 INFO L470 AbstractCegarLoop]: Abstraction has 8118 states and 10661 transitions. [2022-01-10 15:52:50,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 8118 states and 10661 transitions. [2022-01-10 15:52:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-01-10 15:52:50,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:50,246 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:50,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 15:52:50,459 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,SelfDestructingSolverStorable20 [2022-01-10 15:52:50,460 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1804325416, now seen corresponding path program 2 times [2022-01-10 15:52:50,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:50,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304885996] [2022-01-10 15:52:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:50,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1495 backedges. 841 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 15:52:50,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:50,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304885996] [2022-01-10 15:52:50,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304885996] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:50,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059375310] [2022-01-10 15:52:50,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 15:52:50,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:50,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:50,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:52:50,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 15:52:50,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 15:52:50,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 15:52:50,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 15:52:50,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1495 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2022-01-10 15:52:51,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:51,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059375310] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:51,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:51,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:51,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880092176] [2022-01-10 15:52:51,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:51,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:51,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:51,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:51,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:51,290 INFO L87 Difference]: Start difference. First operand 8118 states and 10661 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:51,480 INFO L93 Difference]: Finished difference Result 16448 states and 21586 transitions. [2022-01-10 15:52:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:51,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2022-01-10 15:52:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:51,493 INFO L225 Difference]: With dead ends: 16448 [2022-01-10 15:52:51,493 INFO L226 Difference]: Without dead ends: 8370 [2022-01-10 15:52:51,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:51,501 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:51,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 233 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8370 states. [2022-01-10 15:52:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8370 to 7542. [2022-01-10 15:52:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7542 states, 7541 states have (on average 1.260973345710118) internal successors, (9509), 7541 states have internal predecessors, (9509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7542 states to 7542 states and 9509 transitions. [2022-01-10 15:52:51,686 INFO L78 Accepts]: Start accepts. Automaton has 7542 states and 9509 transitions. Word has length 355 [2022-01-10 15:52:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:51,687 INFO L470 AbstractCegarLoop]: Abstraction has 7542 states and 9509 transitions. [2022-01-10 15:52:51,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7542 states and 9509 transitions. [2022-01-10 15:52:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2022-01-10 15:52:51,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:51,695 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:51,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 15:52:51,914 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,SelfDestructingSolverStorable21 [2022-01-10 15:52:51,914 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:51,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash 441181395, now seen corresponding path program 1 times [2022-01-10 15:52:51,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:51,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035008659] [2022-01-10 15:52:51,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:51,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 15:52:52,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:52,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035008659] [2022-01-10 15:52:52,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035008659] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:52,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359728309] [2022-01-10 15:52:52,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:52,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:52,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:52,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:52:52,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 15:52:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:52,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:52,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 15:52:52,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:52:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 15:52:53,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359728309] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:52:53,309 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:52:53,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 15:52:53,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547956456] [2022-01-10 15:52:53,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:52:53,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 15:52:53,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:53,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 15:52:53,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 15:52:53,311 INFO L87 Difference]: Start difference. First operand 7542 states and 9509 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:53,633 INFO L93 Difference]: Finished difference Result 17163 states and 21539 transitions. [2022-01-10 15:52:53,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 15:52:53,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 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 369 [2022-01-10 15:52:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:53,649 INFO L225 Difference]: With dead ends: 17163 [2022-01-10 15:52:53,649 INFO L226 Difference]: Without dead ends: 9653 [2022-01-10 15:52:53,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 15:52:53,657 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 428 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:53,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 417 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 15:52:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9653 states. [2022-01-10 15:52:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9653 to 7928. [2022-01-10 15:52:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7928 states, 7927 states have (on average 1.2576006055254194) internal successors, (9969), 7927 states have internal predecessors, (9969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7928 states to 7928 states and 9969 transitions. [2022-01-10 15:52:53,789 INFO L78 Accepts]: Start accepts. Automaton has 7928 states and 9969 transitions. Word has length 369 [2022-01-10 15:52:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:53,790 INFO L470 AbstractCegarLoop]: Abstraction has 7928 states and 9969 transitions. [2022-01-10 15:52:53,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 7928 states and 9969 transitions. [2022-01-10 15:52:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-01-10 15:52:53,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:53,798 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:53,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 15:52:54,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:54,016 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1904654198, now seen corresponding path program 1 times [2022-01-10 15:52:54,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:54,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374758567] [2022-01-10 15:52:54,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:54,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 883 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-01-10 15:52:54,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:54,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374758567] [2022-01-10 15:52:54,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374758567] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:54,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:54,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:54,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121325731] [2022-01-10 15:52:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:54,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:54,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:54,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:54,134 INFO L87 Difference]: Start difference. First operand 7928 states and 9969 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:56,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 15:52:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:56,393 INFO L93 Difference]: Finished difference Result 14984 states and 18458 transitions. [2022-01-10 15:52:56,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:56,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 408 [2022-01-10 15:52:56,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:56,400 INFO L225 Difference]: With dead ends: 14984 [2022-01-10 15:52:56,400 INFO L226 Difference]: Without dead ends: 3654 [2022-01-10 15:52:56,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:56,408 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:56,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 258 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:52:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2022-01-10 15:52:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3463. [2022-01-10 15:52:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3463 states, 3462 states have (on average 1.2446562680531486) internal successors, (4309), 3462 states have internal predecessors, (4309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4309 transitions. [2022-01-10 15:52:56,451 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4309 transitions. Word has length 408 [2022-01-10 15:52:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:56,451 INFO L470 AbstractCegarLoop]: Abstraction has 3463 states and 4309 transitions. [2022-01-10 15:52:56,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4309 transitions. [2022-01-10 15:52:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2022-01-10 15:52:56,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:56,456 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:56,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 15:52:56,457 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:56,457 INFO L85 PathProgramCache]: Analyzing trace with hash 213243533, now seen corresponding path program 1 times [2022-01-10 15:52:56,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:56,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138990867] [2022-01-10 15:52:56,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:56,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2022-01-10 15:52:56,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:56,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138990867] [2022-01-10 15:52:56,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138990867] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:56,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790750222] [2022-01-10 15:52:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:56,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:56,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:56,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:52:56,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 15:52:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:56,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:56,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2022-01-10 15:52:58,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:58,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790750222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:58,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:58,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:58,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546283807] [2022-01-10 15:52:58,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:58,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:58,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:58,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:58,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:58,614 INFO L87 Difference]: Start difference. First operand 3463 states and 4309 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:58,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:58,669 INFO L93 Difference]: Finished difference Result 3879 states and 4791 transitions. [2022-01-10 15:52:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:58,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 492 [2022-01-10 15:52:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:58,675 INFO L225 Difference]: With dead ends: 3879 [2022-01-10 15:52:58,675 INFO L226 Difference]: Without dead ends: 3803 [2022-01-10 15:52:58,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:58,677 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 60 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:58,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 436 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3803 states. [2022-01-10 15:52:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3803 to 3389. [2022-01-10 15:52:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3389 states, 3388 states have (on average 1.2446871310507674) internal successors, (4217), 3388 states have internal predecessors, (4217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4217 transitions. [2022-01-10 15:52:58,723 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4217 transitions. Word has length 492 [2022-01-10 15:52:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:58,724 INFO L470 AbstractCegarLoop]: Abstraction has 3389 states and 4217 transitions. [2022-01-10 15:52:58,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4217 transitions. [2022-01-10 15:52:58,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2022-01-10 15:52:58,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:58,730 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:58,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 15:52:58,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:58,950 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:58,950 INFO L85 PathProgramCache]: Analyzing trace with hash 511138568, now seen corresponding path program 1 times [2022-01-10 15:52:58,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:58,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930476342] [2022-01-10 15:52:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:58,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2022-01-10 15:52:59,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:59,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930476342] [2022-01-10 15:52:59,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930476342] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:59,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351286305] [2022-01-10 15:52:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:59,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:59,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:59,062 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-10 15:52:59,076 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-10 15:52:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:59,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 2253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:59,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:53:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2022-01-10 15:53:00,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:53:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2022-01-10 15:53:00,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351286305] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:53:00,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:53:00,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-10 15:53:00,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421768407] [2022-01-10 15:53:00,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:53:00,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 15:53:00,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:00,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 15:53:00,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 15:53:00,758 INFO L87 Difference]: Start difference. First operand 3389 states and 4217 transitions. Second operand has 7 states, 7 states have (on average 44.142857142857146) internal successors, (309), 7 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:01,063 INFO L93 Difference]: Finished difference Result 4238 states and 5270 transitions. [2022-01-10 15:53:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 15:53:01,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 44.142857142857146) internal successors, (309), 7 states have internal predecessors, (309), 0 states have call successors, (0), 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 604 [2022-01-10 15:53:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:01,064 INFO L225 Difference]: With dead ends: 4238 [2022-01-10 15:53:01,064 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 15:53:01,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 1207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 15:53:01,066 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 111 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:01,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 466 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 15:53:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 15:53:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 15:53:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 15:53:01,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 604 [2022-01-10 15:53:01,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:01,067 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 15:53:01,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 44.142857142857146) internal successors, (309), 7 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 15:53:01,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 15:53:01,072 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 15:53:01,109 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-10 15:53:01,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-10 15:53:01,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 15:53:05,007 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 15:53:05,007 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 15:53:05,007 INFO L858 garLoopResultBuilder]: For program point L86(lines 86 94) no Hoare annotation was computed. [2022-01-10 15:53:05,007 INFO L858 garLoopResultBuilder]: For program point L89-2(lines 86 94) no Hoare annotation was computed. [2022-01-10 15:53:05,007 INFO L858 garLoopResultBuilder]: For program point L89(lines 89 93) no Hoare annotation was computed. [2022-01-10 15:53:05,007 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 104) no Hoare annotation was computed. [2022-01-10 15:53:05,007 INFO L858 garLoopResultBuilder]: For program point L97(lines 97 101) no Hoare annotation was computed. [2022-01-10 15:53:05,007 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 72 620) no Hoare annotation was computed. [2022-01-10 15:53:05,008 INFO L861 garLoopResultBuilder]: At program point L608(lines 105 609) the Hoare annotation is: true [2022-01-10 15:53:05,008 INFO L858 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-01-10 15:53:05,008 INFO L858 garLoopResultBuilder]: For program point L612(lines 612 616) no Hoare annotation was computed. [2022-01-10 15:53:05,008 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 576) no Hoare annotation was computed. [2022-01-10 15:53:05,008 INFO L858 garLoopResultBuilder]: For program point L612-2(lines 612 616) no Hoare annotation was computed. [2022-01-10 15:53:05,008 INFO L854 garLoopResultBuilder]: At program point L110(lines 109 576) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 15:53:05,008 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 575) no Hoare annotation was computed. [2022-01-10 15:53:05,008 INFO L861 garLoopResultBuilder]: At program point L619(lines 19 621) the Hoare annotation is: true [2022-01-10 15:53:05,008 INFO L854 garLoopResultBuilder]: At program point L215(lines 112 575) the Hoare annotation is: (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) [2022-01-10 15:53:05,008 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 574) no Hoare annotation was computed. [2022-01-10 15:53:05,008 INFO L861 garLoopResultBuilder]: At program point L630(lines 622 632) the Hoare annotation is: true [2022-01-10 15:53:05,009 INFO L858 garLoopResultBuilder]: For program point L220(lines 220 224) no Hoare annotation was computed. [2022-01-10 15:53:05,009 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 573) no Hoare annotation was computed. [2022-01-10 15:53:05,009 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 15:53:05,009 INFO L858 garLoopResultBuilder]: For program point L220-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 15:53:05,009 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 572) no Hoare annotation was computed. [2022-01-10 15:53:05,009 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 15:53:05,009 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 249) no Hoare annotation was computed. [2022-01-10 15:53:05,009 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 571) no Hoare annotation was computed. [2022-01-10 15:53:05,010 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 239) no Hoare annotation was computed. [2022-01-10 15:53:05,010 INFO L858 garLoopResultBuilder]: For program point L232-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 15:53:05,010 INFO L854 garLoopResultBuilder]: At program point L128(lines 124 571) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 15:53:05,010 INFO L858 garLoopResultBuilder]: For program point L127(lines 127 570) no Hoare annotation was computed. [2022-01-10 15:53:05,011 INFO L858 garLoopResultBuilder]: For program point L240(lines 240 245) no Hoare annotation was computed. [2022-01-10 15:53:05,011 INFO L858 garLoopResultBuilder]: For program point L256(lines 256 261) no Hoare annotation was computed. [2022-01-10 15:53:05,011 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 274) no Hoare annotation was computed. [2022-01-10 15:53:05,011 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 569) no Hoare annotation was computed. [2022-01-10 15:53:05,012 INFO L854 garLoopResultBuilder]: At program point L541(lines 106 607) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0))) (let ((.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse5 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse6 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (.cse12 (= 4496 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse2 (= 4448 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse14 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse11 (not .cse0)) (.cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|)) (.cse3 (= 4528 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse9 (= 4512 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse17 (= 4480 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse16 (= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4)) (.cse18 (= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 3)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse5 .cse1 .cse6) (and .cse7 (= 4416 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse0) (and .cse8 .cse9 .cse10) (and .cse7 .cse0 (= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse4 .cse5 .cse8 .cse11 .cse10) (and .cse0 .cse1 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse6) (and .cse7 .cse0 .cse12) (and .cse1 .cse15) (and .cse7 .cse0 .cse2) (and .cse16 .cse0 .cse10) (and .cse13 .cse8 .cse14 .cse11 .cse10) (and .cse7 .cse17 .cse0) (and .cse0 .cse1 .cse9) (and (= 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse10) (and .cse7 .cse0 .cse3) (and .cse18 .cse0 .cse1) (and .cse8 .cse3 .cse10) (and .cse7 .cse0 .cse9) (and .cse17 .cse0 .cse1) (and .cse7 .cse16 .cse0 .cse1) (and .cse7 .cse18 .cse0) (and .cse0 .cse15 .cse10)))) [2022-01-10 15:53:05,012 INFO L858 garLoopResultBuilder]: For program point L270-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 15:53:05,012 INFO L854 garLoopResultBuilder]: At program point L134(lines 130 569) the Hoare annotation is: (and (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) [2022-01-10 15:53:05,012 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 568) no Hoare annotation was computed. [2022-01-10 15:53:05,012 INFO L858 garLoopResultBuilder]: For program point L578(lines 578 602) no Hoare annotation was computed. [2022-01-10 15:53:05,012 INFO L858 garLoopResultBuilder]: For program point L577(lines 577 605) no Hoare annotation was computed. [2022-01-10 15:53:05,012 INFO L858 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2022-01-10 15:53:05,012 INFO L858 garLoopResultBuilder]: For program point L291(lines 291 299) no Hoare annotation was computed. [2022-01-10 15:53:05,012 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 567) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L579(lines 579 588) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L294-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 298) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L854 garLoopResultBuilder]: At program point L140(lines 136 567) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (< 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)))) [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 566) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L579-2(lines 578 600) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L305(lines 305 309) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L314-1(lines 314 328) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L318(lines 318 322) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 565) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 596) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L305-2(lines 305 309) no Hoare annotation was computed. [2022-01-10 15:53:05,013 INFO L858 garLoopResultBuilder]: For program point L318-2(lines 316 328) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L854 garLoopResultBuilder]: At program point L146(lines 142 565) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (< 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1))) [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 564) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 563) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L335-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L854 garLoopResultBuilder]: At program point L152(lines 148 563) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1))) [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 562) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 352) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 561) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L854 garLoopResultBuilder]: At program point L358(lines 72 620) the Hoare annotation is: false [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L854 garLoopResultBuilder]: At program point L158(lines 154 561) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 560) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2022-01-10 15:53:05,014 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 559) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L854 garLoopResultBuilder]: At program point L170(lines 160 559) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 558) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L378-2(lines 378 382) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 557) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 556) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 555) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L854 garLoopResultBuilder]: At program point L176(lines 172 555) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 554) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 405) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 553) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L854 garLoopResultBuilder]: At program point L182(lines 178 553) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 552) no Hoare annotation was computed. [2022-01-10 15:53:05,015 INFO L858 garLoopResultBuilder]: For program point L407-2(lines 407 412) no Hoare annotation was computed. [2022-01-10 15:53:05,016 INFO L858 garLoopResultBuilder]: For program point L418(lines 418 422) no Hoare annotation was computed. [2022-01-10 15:53:05,016 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 551) no Hoare annotation was computed. [2022-01-10 15:53:05,017 INFO L854 garLoopResultBuilder]: At program point L188(lines 184 551) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 15:53:05,017 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 550) no Hoare annotation was computed. [2022-01-10 15:53:05,017 INFO L858 garLoopResultBuilder]: For program point L430(lines 430 434) no Hoare annotation was computed. [2022-01-10 15:53:05,017 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 549) no Hoare annotation was computed. [2022-01-10 15:53:05,017 INFO L858 garLoopResultBuilder]: For program point L438(lines 438 442) no Hoare annotation was computed. [2022-01-10 15:53:05,017 INFO L854 garLoopResultBuilder]: At program point L194(lines 190 549) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 15:53:05,017 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 548) no Hoare annotation was computed. [2022-01-10 15:53:05,017 INFO L858 garLoopResultBuilder]: For program point L438-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 15:53:05,017 INFO L858 garLoopResultBuilder]: For program point L459(lines 459 463) no Hoare annotation was computed. [2022-01-10 15:53:05,017 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 547) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 454) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L466(lines 466 477) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L854 garLoopResultBuilder]: At program point L200(lines 196 547) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse0 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 12292) .cse0) (and .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse0 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (and .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse0 (not .cse1) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 546) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 474) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L466-1(lines 466 477) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L483(lines 483 487) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 545) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L854 garLoopResultBuilder]: At program point L203(lines 202 545) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse2 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse1 .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) (not .cse0) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse1 .cse2))) [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 544) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L488-2(lines 488 492) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L499(lines 499 504) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L496-1(lines 496 508) no Hoare annotation was computed. [2022-01-10 15:53:05,018 INFO L861 garLoopResultBuilder]: At program point L206(lines 205 544) the Hoare annotation is: true [2022-01-10 15:53:05,018 INFO L861 garLoopResultBuilder]: At program point L209(lines 208 543) the Hoare annotation is: true [2022-01-10 15:53:05,018 INFO L858 garLoopResultBuilder]: For program point L512-1(lines 210 540) no Hoare annotation was computed. [2022-01-10 15:53:05,019 INFO L858 garLoopResultBuilder]: For program point L517-1(lines 517 521) no Hoare annotation was computed. [2022-01-10 15:53:05,019 INFO L858 garLoopResultBuilder]: For program point L524(lines 524 528) no Hoare annotation was computed. [2022-01-10 15:53:05,019 INFO L858 garLoopResultBuilder]: For program point L524-2(lines 524 528) no Hoare annotation was computed. [2022-01-10 15:53:05,019 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-01-10 15:53:05,021 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:05,022 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 15:53:05,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:53:05 BasicIcfg [2022-01-10 15:53:05,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 15:53:05,057 INFO L158 Benchmark]: Toolchain (without parser) took 50010.71ms. Allocated memory was 203.4MB in the beginning and 423.6MB in the end (delta: 220.2MB). Free memory was 176.7MB in the beginning and 132.7MB in the end (delta: 44.1MB). Peak memory consumption was 313.9MB. Max. memory is 8.0GB. [2022-01-10 15:53:05,057 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 163.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 15:53:05,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.70ms. Allocated memory is still 203.4MB. Free memory was 176.5MB in the beginning and 170.0MB in the end (delta: 6.5MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-01-10 15:53:05,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.32ms. Allocated memory is still 203.4MB. Free memory was 170.0MB in the beginning and 167.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 15:53:05,058 INFO L158 Benchmark]: Boogie Preprocessor took 35.52ms. Allocated memory is still 203.4MB. Free memory was 167.6MB in the beginning and 165.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 15:53:05,058 INFO L158 Benchmark]: RCFGBuilder took 456.57ms. Allocated memory is still 203.4MB. Free memory was 165.5MB in the beginning and 141.7MB in the end (delta: 23.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-01-10 15:53:05,058 INFO L158 Benchmark]: IcfgTransformer took 193.97ms. Allocated memory is still 203.4MB. Free memory was 141.4MB in the beginning and 123.9MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-01-10 15:53:05,058 INFO L158 Benchmark]: TraceAbstraction took 48941.72ms. Allocated memory was 203.4MB in the beginning and 423.6MB in the end (delta: 220.2MB). Free memory was 123.6MB in the beginning and 132.7MB in the end (delta: -9.1MB). Peak memory consumption was 261.9MB. Max. memory is 8.0GB. [2022-01-10 15:53:05,059 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 203.4MB. Free memory is still 163.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 322.70ms. Allocated memory is still 203.4MB. Free memory was 176.5MB in the beginning and 170.0MB in the end (delta: 6.5MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.32ms. Allocated memory is still 203.4MB. Free memory was 170.0MB in the beginning and 167.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.52ms. Allocated memory is still 203.4MB. Free memory was 167.6MB in the beginning and 165.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 456.57ms. Allocated memory is still 203.4MB. Free memory was 165.5MB in the beginning and 141.7MB in the end (delta: 23.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * IcfgTransformer took 193.97ms. Allocated memory is still 203.4MB. Free memory was 141.4MB in the beginning and 123.9MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 48941.72ms. Allocated memory was 203.4MB in the beginning and 423.6MB in the end (delta: 220.2MB). Free memory was 123.6MB in the beginning and 132.7MB in the end (delta: -9.1MB). Peak memory consumption was 261.9MB. 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: 618]: 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, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.9s, OverallIterations: 26, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 33.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 2249 SdHoareTripleChecker+Valid, 32.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2249 mSDsluCounter, 8002 SdHoareTripleChecker+Invalid, 30.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2992 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2959 IncrementalHoareTripleChecker+Invalid, 3562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 5010 mSDtfsCounter, 2959 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3564 GetRequests, 3519 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8118occurred in iteration=21, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 6244 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 256 NumberOfFragments, 745 HoareAnnotationTreeSize, 22 FomulaSimplifications, 14888 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 11217 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 8422 NumberOfCodeBlocks, 8422 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 9704 ConstructedInterpolants, 0 QuantifiedInterpolants, 15370 SizeOfPredicates, 4 NumberOfNonLiveVariables, 8445 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 42879/42991 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 && ~bvule32(4560bv32, s__state) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state)) || ((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4560bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(4560bv32, s__state)) && ~bvult64(s__state, 12292bv32)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvult64(4384bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvult64(4384bv32, s__state)) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvult64(4384bv32, s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvult64(4384bv32, s__state)) && ~bvule32(blastFlag, 4bv32))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvult64(4384bv32, s__state)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32)) || ((blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && ~bvule32(s__state, 4352bv32))) || (((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(4352bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32)) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4432bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && s__state == 4400bv32) || blastFlag == 0bv32) || (((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32)) && s__state == 4400bv32)) || ((0bv32 == s__hit && 4512bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(0bv32, s__hit)) && 4512bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32))) || (~bvule32(blastFlag, 2bv32) && s__state == 4384bv32)) || ((s__state == 4448bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4480bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(0bv32, s__hit)) && 4528bv32 == s__state)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && s__state == 4448bv32) && 0bv32 == s__hit)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && s__state == 4496bv32)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4512bv32 == s__state)) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4432bv32 == s__state)) || (~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 3bv32))) || ((s__state == 4416bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || (((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(4352bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32))) || ((0bv32 == s__hit && s__state == 4496bv32) && ~bvule32(blastFlag, 4bv32))) || ((0bv32 == s__hit && 4480bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && ~bvule32(s__state, 3bv32))) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4464bv32 == s__state)) || ((0bv32 == s__hit && 4528bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4464bv32 == s__state)) || ((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4560bv32, s__state))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4528bv32 == s__state) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state)) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4432bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 15:53:05,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...