/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 05:22:54,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 05:22:54,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 05:22:54,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 05:22:54,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 05:22:54,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 05:22:54,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 05:22:54,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 05:22:54,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 05:22:54,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 05:22:54,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 05:22:54,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 05:22:54,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 05:22:54,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 05:22:54,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 05:22:54,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 05:22:54,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 05:22:54,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 05:22:54,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 05:22:54,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 05:22:54,466 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 05:22:54,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 05:22:54,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 05:22:54,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 05:22:54,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 05:22:54,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 05:22:54,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 05:22:54,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 05:22:54,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 05:22:54,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 05:22:54,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 05:22:54,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 05:22:54,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 05:22:54,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 05:22:54,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 05:22:54,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 05:22:54,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 05:22:54,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 05:22:54,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 05:22:54,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 05:22:54,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 05:22:54,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 05:22:54,481 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 05:22:54,499 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 05:22:54,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 05:22:54,500 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 05:22:54,500 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 05:22:54,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 05:22:54,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 05:22:54,501 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 05:22:54,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 05:22:54,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 05:22:54,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 05:22:54,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 05:22:54,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 05:22:54,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 05:22:54,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 05:22:54,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 05:22:54,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 05:22:54,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 05:22:54,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 05:22:54,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 05:22:54,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:22:54,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 05:22:54,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 05:22:54,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 05:22:54,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 05:22:54,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 05:22:54,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 05:22:54,504 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 05:22:54,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 05:22:54,504 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 05:22:54,504 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-04-05 05:22:54,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 05:22:54,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 05:22:54,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 05:22:54,715 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 05:22:54,716 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 05:22:54,716 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-04-05 05:22:54,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88f9827e/e097c69fbd4a4e238e90d139e686fb5d/FLAG8faf9ddf9 [2022-04-05 05:22:55,084 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 05:22:55,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-04-05 05:22:55,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88f9827e/e097c69fbd4a4e238e90d139e686fb5d/FLAG8faf9ddf9 [2022-04-05 05:22:55,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88f9827e/e097c69fbd4a4e238e90d139e686fb5d [2022-04-05 05:22:55,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 05:22:55,502 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 05:22:55,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 05:22:55,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 05:22:55,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 05:22:55,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e119fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55, skipping insertion in model container [2022-04-05 05:22:55,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 05:22:55,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 05:22:55,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2022-04-05 05:22:55,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:22:55,668 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 05:22:55,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2022-04-05 05:22:55,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:22:55,686 INFO L208 MainTranslator]: Completed translation [2022-04-05 05:22:55,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55 WrapperNode [2022-04-05 05:22:55,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 05:22:55,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 05:22:55,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 05:22:55,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 05:22:55,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 05:22:55,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 05:22:55,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 05:22:55,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 05:22:55,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:22:55,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:22:55,737 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-04-05 05:22:55,743 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-04-05 05:22:55,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 05:22:55,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 05:22:55,764 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 05:22:55,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-05 05:22:55,764 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 05:22:55,764 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 05:22:55,764 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 05:22:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 05:22:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 05:22:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 05:22:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 05:22:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 05:22:55,819 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 05:22:55,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 05:22:55,971 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 05:22:55,990 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 05:22:55,990 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 05:22:55,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:22:55 BoogieIcfgContainer [2022-04-05 05:22:55,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 05:22:55,992 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 05:22:55,992 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 05:22:55,993 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 05:22:55,995 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:22:55" (1/1) ... [2022-04-05 05:22:55,996 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 05:22:56,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:22:56 BasicIcfg [2022-04-05 05:22:56,021 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 05:22:56,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 05:22:56,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 05:22:56,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 05:22:56,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:22:55" (1/4) ... [2022-04-05 05:22:56,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590e6ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:22:56, skipping insertion in model container [2022-04-05 05:22:56,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:22:55" (2/4) ... [2022-04-05 05:22:56,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590e6ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:22:56, skipping insertion in model container [2022-04-05 05:22:56,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:22:55" (3/4) ... [2022-04-05 05:22:56,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590e6ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:22:56, skipping insertion in model container [2022-04-05 05:22:56,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:22:56" (4/4) ... [2022-04-05 05:22:56,026 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.iqvasr [2022-04-05 05:22:56,032 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 05:22:56,032 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 05:22:56,071 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 05:22:56,077 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-05 05:22:56,077 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 05:22:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-05 05:22:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-05 05:22:56,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:22:56,095 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:22:56,095 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:22:56,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:22:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1933732557, now seen corresponding path program 1 times [2022-04-05 05:22:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:22:56,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297859019] [2022-04-05 05:22:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:22:56,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:22:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:22:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:22:56,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:22:56,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297859019] [2022-04-05 05:22:56,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297859019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:22:56,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:22:56,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-05 05:22:56,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826970106] [2022-04-05 05:22:56,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:22:56,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 05:22:56,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:22:56,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 05:22:56,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 05:22:56,282 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:22:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:22:56,366 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2022-04-05 05:22:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 05:22:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-05 05:22:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:22:56,374 INFO L225 Difference]: With dead ends: 62 [2022-04-05 05:22:56,374 INFO L226 Difference]: Without dead ends: 30 [2022-04-05 05:22:56,376 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04-05 05:22:56,380 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:22:56,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:22:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-05 05:22:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-05 05:22:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-05 05:22:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-05 05:22:56,415 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2022-04-05 05:22:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:22:56,416 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-05 05:22:56,417 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:22:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-05 05:22:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-05 05:22:56,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:22:56,418 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:22:56,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 05:22:56,419 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:22:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:22:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash 213262551, now seen corresponding path program 1 times [2022-04-05 05:22:56,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:22:56,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136792669] [2022-04-05 05:22:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:22:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:22:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:56,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:22:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:22:56,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:22:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136792669] [2022-04-05 05:22:56,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136792669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:22:56,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:22:56,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:22:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864561069] [2022-04-05 05:22:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:22:56,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:22:56,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:22:56,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:22:56,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:22:56,517 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:22:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:22:56,644 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-05 05:22:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:22:56,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-05 05:22:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:22:56,646 INFO L225 Difference]: With dead ends: 36 [2022-04-05 05:22:56,646 INFO L226 Difference]: Without dead ends: 34 [2022-04-05 05:22:56,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 05:22:56,648 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:22:56,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:22:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-05 05:22:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-05 05:22:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-05 05:22:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-05 05:22:56,658 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2022-04-05 05:22:56,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:22:56,658 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-05 05:22:56,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:22:56,658 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-05 05:22:56,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-05 05:22:56,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:22:56,659 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:22:56,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 05:22:56,659 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:22:56,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:22:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1077134525, now seen corresponding path program 1 times [2022-04-05 05:22:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:22:56,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456076909] [2022-04-05 05:22:56,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:22:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:22:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:56,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:22:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:56,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 05:22:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:22:56,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:22:56,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456076909] [2022-04-05 05:22:56,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456076909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:22:56,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:22:56,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:22:56,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023917955] [2022-04-05 05:22:56,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:22:56,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:22:56,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:22:56,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:22:56,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:22:56,727 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 05:22:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:22:56,876 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-05 05:22:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 05:22:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-05 05:22:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:22:56,880 INFO L225 Difference]: With dead ends: 49 [2022-04-05 05:22:56,880 INFO L226 Difference]: Without dead ends: 47 [2022-04-05 05:22:56,881 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-05 05:22:56,885 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:22:56,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:22:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-05 05:22:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-04-05 05:22:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-05 05:22:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-04-05 05:22:56,924 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2022-04-05 05:22:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:22:56,924 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-04-05 05:22:56,925 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 05:22:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-05 05:22:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-05 05:22:56,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:22:56,925 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-05 05:22:56,926 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 05:22:56,926 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:22:56,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:22:56,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2113482804, now seen corresponding path program 1 times [2022-04-05 05:22:56,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:22:56,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940191112] [2022-04-05 05:22:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:22:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:22:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:22:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 05:22:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 05:22:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-05 05:22:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:22:57,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940191112] [2022-04-05 05:22:57,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940191112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:22:57,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:22:57,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:22:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487098002] [2022-04-05 05:22:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:22:57,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:22:57,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:22:57,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:22:57,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:22:57,028 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 05:22:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:22:57,199 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-04-05 05:22:57,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 05:22:57,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-05 05:22:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:22:57,201 INFO L225 Difference]: With dead ends: 56 [2022-04-05 05:22:57,201 INFO L226 Difference]: Without dead ends: 54 [2022-04-05 05:22:57,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-05 05:22:57,202 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:22:57,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:22:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-05 05:22:57,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-04-05 05:22:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-05 05:22:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-04-05 05:22:57,208 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 29 [2022-04-05 05:22:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:22:57,209 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-04-05 05:22:57,209 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 05:22:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-05 05:22:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-05 05:22:57,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:22:57,210 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:22:57,210 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-05 05:22:57,210 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:22:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:22:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1308577884, now seen corresponding path program 1 times [2022-04-05 05:22:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:22:57,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919675383] [2022-04-05 05:22:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:22:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:22:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:22:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 05:22:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-05 05:22:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-05 05:22:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-05 05:22:57,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:22:57,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919675383] [2022-04-05 05:22:57,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919675383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:22:57,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:22:57,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 05:22:57,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31273632] [2022-04-05 05:22:57,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:22:57,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 05:22:57,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:22:57,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 05:22:57,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:22:57,299 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-05 05:22:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:22:57,489 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-05 05:22:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:22:57,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-05 05:22:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:22:57,492 INFO L225 Difference]: With dead ends: 75 [2022-04-05 05:22:57,492 INFO L226 Difference]: Without dead ends: 68 [2022-04-05 05:22:57,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-05 05:22:57,493 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:22:57,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 45 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:22:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-05 05:22:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-04-05 05:22:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-05 05:22:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-05 05:22:57,506 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2022-04-05 05:22:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:22:57,506 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-05 05:22:57,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-05 05:22:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-05 05:22:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-05 05:22:57,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:22:57,507 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 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-04-05 05:22:57,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-05 05:22:57,507 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:22:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:22:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1447644068, now seen corresponding path program 1 times [2022-04-05 05:22:57,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:22:57,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769843191] [2022-04-05 05:22:57,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:22:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:22:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:22:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 05:22:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 05:22:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 05:22:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-05 05:22:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:22:57,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769843191] [2022-04-05 05:22:57,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769843191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:22:57,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:22:57,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 05:22:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699841125] [2022-04-05 05:22:57,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:22:57,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 05:22:57,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:22:57,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 05:22:57,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-05 05:22:57,592 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-05 05:22:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:22:57,788 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-05 05:22:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 05:22:57,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-05 05:22:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:22:57,789 INFO L225 Difference]: With dead ends: 77 [2022-04-05 05:22:57,789 INFO L226 Difference]: Without dead ends: 75 [2022-04-05 05:22:57,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-05 05:22:57,790 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:22:57,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 61 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:22:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-05 05:22:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-04-05 05:22:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-05 05:22:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-04-05 05:22:57,798 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2022-04-05 05:22:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:22:57,798 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-04-05 05:22:57,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-05 05:22:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-04-05 05:22:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-05 05:22:57,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:22:57,799 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 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-04-05 05:22:57,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-05 05:22:57,799 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:22:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:22:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1060067119, now seen corresponding path program 1 times [2022-04-05 05:22:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:22:57,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32099239] [2022-04-05 05:22:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:22:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:22:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:22:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 05:22:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 05:22:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 05:22:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 05:22:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-05 05:22:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-05 05:22:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-05 05:22:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-05 05:22:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:22:57,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32099239] [2022-04-05 05:22:57,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32099239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:22:57,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453957001] [2022-04-05 05:22:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:22:57,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:22:57,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:22:57,928 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-04-05 05:22:57,929 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-04-05 05:22:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:57,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-05 05:22:57,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:22:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-05 05:22:58,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:22:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-05 05:22:58,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453957001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:22:58,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:22:58,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-05 05:22:58,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799695356] [2022-04-05 05:22:58,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:22:58,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-05 05:22:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:22:58,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-05 05:22:58,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-05 05:22:58,471 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 18 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-04-05 05:22:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:22:59,060 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2022-04-05 05:22:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-05 05:22:59,061 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 57 [2022-04-05 05:22:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:22:59,062 INFO L225 Difference]: With dead ends: 115 [2022-04-05 05:22:59,062 INFO L226 Difference]: Without dead ends: 100 [2022-04-05 05:22:59,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2022-04-05 05:22:59,063 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 97 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 05:22:59,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 75 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 05:22:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-05 05:22:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2022-04-05 05:22:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-05 05:22:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2022-04-05 05:22:59,073 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 57 [2022-04-05 05:22:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:22:59,073 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2022-04-05 05:22:59,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-04-05 05:22:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-04-05 05:22:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-05 05:22:59,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:22:59,074 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2022-04-05 05:22:59,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-05 05:22:59,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:22:59,288 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:22:59,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:22:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1512463065, now seen corresponding path program 1 times [2022-04-05 05:22:59,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:22:59,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873396495] [2022-04-05 05:22:59,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:22:59,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:22:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:59,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:22:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:59,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 05:22:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:59,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 05:22:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 05:22:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 05:22:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-05 05:22:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:59,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 05:22:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-05 05:22:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-05 05:22:59,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:22:59,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873396495] [2022-04-05 05:22:59,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873396495] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:22:59,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924713204] [2022-04-05 05:22:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:22:59,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:22:59,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:22:59,383 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-04-05 05:22:59,392 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-04-05 05:22:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:22:59,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-05 05:22:59,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:22:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-05 05:22:59,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:22:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-05 05:22:59,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924713204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:22:59,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:22:59,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-04-05 05:22:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65544177] [2022-04-05 05:22:59,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:22:59,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-05 05:22:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:22:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-05 05:22:59,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-05 05:22:59,699 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-04-05 05:22:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:22:59,947 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2022-04-05 05:22:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 05:22:59,948 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 59 [2022-04-05 05:22:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:22:59,949 INFO L225 Difference]: With dead ends: 98 [2022-04-05 05:22:59,949 INFO L226 Difference]: Without dead ends: 96 [2022-04-05 05:22:59,950 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-04-05 05:22:59,950 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 103 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:22:59,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 76 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:22:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-05 05:22:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-05 05:22:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 62 states have internal predecessors, (64), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-05 05:22:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2022-04-05 05:22:59,959 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 59 [2022-04-05 05:22:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:22:59,959 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2022-04-05 05:22:59,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-04-05 05:22:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2022-04-05 05:22:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-05 05:22:59,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:22:59,960 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:22:59,978 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-04-05 05:23:00,160 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-05 05:23:00,161 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:23:00,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:23:00,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1765383868, now seen corresponding path program 2 times [2022-04-05 05:23:00,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:23:00,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236691218] [2022-04-05 05:23:00,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:23:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:23:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:23:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 05:23:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 05:23:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 05:23:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 05:23:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-05 05:23:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 05:23:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-05 05:23:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-05 05:23:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-05 05:23:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-05 05:23:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-05 05:23:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-05 05:23:00,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:23:00,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236691218] [2022-04-05 05:23:00,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236691218] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:23:00,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944165164] [2022-04-05 05:23:00,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 05:23:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:23:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:23:00,359 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-04-05 05:23:00,360 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-04-05 05:23:00,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 05:23:00,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:23:00,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-05 05:23:00,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:23:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-05 05:23:00,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:23:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-05 05:23:00,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944165164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:23:00,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:23:00,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 27 [2022-04-05 05:23:00,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169973640] [2022-04-05 05:23:00,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:23:00,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-05 05:23:00,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:23:00,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-05 05:23:00,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2022-04-05 05:23:00,877 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 27 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (38), 4 states have call predecessors, (38), 2 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2022-04-05 05:23:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:23:01,700 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2022-04-05 05:23:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-05 05:23:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (38), 4 states have call predecessors, (38), 2 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) Word has length 84 [2022-04-05 05:23:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:23:01,701 INFO L225 Difference]: With dead ends: 113 [2022-04-05 05:23:01,702 INFO L226 Difference]: Without dead ends: 111 [2022-04-05 05:23:01,702 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 177 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=479, Invalid=1971, Unknown=0, NotChecked=0, Total=2450 [2022-04-05 05:23:01,703 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 106 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 05:23:01,703 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 92 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 05:23:01,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-05 05:23:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2022-04-05 05:23:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 26 states have call successors, (26), 12 states have call predecessors, (26), 11 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-05 05:23:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2022-04-05 05:23:01,712 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 84 [2022-04-05 05:23:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:23:01,713 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2022-04-05 05:23:01,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (38), 4 states have call predecessors, (38), 2 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2022-04-05 05:23:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2022-04-05 05:23:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-05 05:23:01,714 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:23:01,714 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:23:01,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-05 05:23:01,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:23:01,928 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:23:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:23:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 446349519, now seen corresponding path program 2 times [2022-04-05 05:23:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:23:01,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969352981] [2022-04-05 05:23:01,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:23:01,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:23:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:23:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 05:23:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 05:23:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 05:23:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 05:23:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-05 05:23:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 05:23:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-05 05:23:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-05 05:23:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-05 05:23:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-05 05:23:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-05 05:23:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-05 05:23:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-05 05:23:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-05 05:23:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-05 05:23:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:23:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2022-04-05 05:23:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:23:02,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969352981] [2022-04-05 05:23:02,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969352981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:23:02,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190541481] [2022-04-05 05:23:02,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 05:23:02,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:23:02,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:23:02,097 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-04-05 05:23:02,099 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-04-05 05:23:02,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 05:23:02,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:23:02,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-05 05:23:02,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:23:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-04-05 05:23:02,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:23:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-04-05 05:23:02,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190541481] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:23:02,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:23:02,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2022-04-05 05:23:02,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703379076] [2022-04-05 05:23:02,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:23:02,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 05:23:02,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:23:02,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 05:23:02,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-05 05:23:02,660 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-05 05:23:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:23:03,018 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-04-05 05:23:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-05 05:23:03,019 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 107 [2022-04-05 05:23:03,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:23:03,019 INFO L225 Difference]: With dead ends: 100 [2022-04-05 05:23:03,019 INFO L226 Difference]: Without dead ends: 0 [2022-04-05 05:23:03,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 240 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2022-04-05 05:23:03,020 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:23:03,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 78 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:23:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-05 05:23:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-05 05:23:03,021 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-04-05 05:23:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-05 05:23:03,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2022-04-05 05:23:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:23:03,021 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-05 05:23:03,021 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-05 05:23:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-05 05:23:03,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-05 05:23:03,023 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 05:23:03,040 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-04-05 05:23:03,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:23:03,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-05 05:23:03,734 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-05 05:23:03,735 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-05 05:23:03,735 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-05 05:23:03,735 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-05 05:23:03,735 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-05 05:23:03,735 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-05 05:23:03,735 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-05 05:23:03,735 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2022-04-05 05:23:03,735 INFO L882 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-05 05:23:03,735 INFO L882 garLoopResultBuilder]: For program point L31-1(lines 25 56) no Hoare annotation was computed. [2022-04-05 05:23:03,735 INFO L885 garLoopResultBuilder]: At program point L55(lines 25 56) the Hoare annotation is: true [2022-04-05 05:23:03,735 INFO L882 garLoopResultBuilder]: For program point L32(lines 25 56) no Hoare annotation was computed. [2022-04-05 05:23:03,735 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 56) no Hoare annotation was computed. [2022-04-05 05:23:03,735 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-05 05:23:03,736 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 56) no Hoare annotation was computed. [2022-04-05 05:23:03,736 INFO L878 garLoopResultBuilder]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse1 (< main_~bufferlen~0 main_~inlen~0)) (.cse0 (+ 2 main_~buflim~0))) (or (and (= .cse0 main_~bufferlen~0) (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0) .cse1) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) .cse1 (<= .cse0 main_~bufferlen~0)))) [2022-04-05 05:23:03,736 INFO L878 garLoopResultBuilder]: At program point L37-3(lines 37 48) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= 0 main_~buf~0))) (or (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0)) (and .cse0 .cse1 .cse2 (<= main_~buf~0 2) (<= 3 main_~inlen~0)) (let ((.cse3 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 .cse2 (<= main_~bufferlen~0 .cse3) (< main_~bufferlen~0 main_~inlen~0) (<= .cse3 main_~bufferlen~0))))) [2022-04-05 05:23:03,736 INFO L882 garLoopResultBuilder]: For program point L37-1(lines 37 48) no Hoare annotation was computed. [2022-04-05 05:23:03,736 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= 0 main_~buf~0))) (or (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0)) (and .cse0 .cse1 .cse2 (<= main_~buf~0 2) (<= 3 main_~inlen~0)) (let ((.cse3 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 .cse2 (<= main_~bufferlen~0 .cse3) (< main_~bufferlen~0 main_~inlen~0) (<= .cse3 main_~bufferlen~0))))) [2022-04-05 05:23:03,736 INFO L882 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-04-05 05:23:03,736 INFO L882 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-04-05 05:23:03,736 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0)) (.cse1 (< main_~bufferlen~0 main_~inlen~0))) (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) .cse1 (<= .cse0 main_~bufferlen~0)) (and (= .cse0 main_~bufferlen~0) (= main_~in~0 0) (<= 3 main_~bufferlen~0) (= main_~buf~0 0) .cse1))) [2022-04-05 05:23:03,736 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-04-05 05:23:03,736 INFO L878 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0)) (.cse1 (< main_~bufferlen~0 main_~inlen~0))) (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) .cse1 (<= .cse0 main_~bufferlen~0)) (and (= .cse0 main_~bufferlen~0) (= main_~in~0 0) (<= 3 main_~bufferlen~0) (= main_~buf~0 0) .cse1))) [2022-04-05 05:23:03,736 INFO L878 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-04-05 05:23:03,737 INFO L882 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-04-05 05:23:03,737 INFO L882 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-04-05 05:23:03,737 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (< main_~bufferlen~0 main_~inlen~0) (<= .cse0 main_~bufferlen~0))) [2022-04-05 05:23:03,737 INFO L882 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-04-05 05:23:03,737 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (< main_~bufferlen~0 main_~inlen~0) (<= .cse0 main_~bufferlen~0))) [2022-04-05 05:23:03,737 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-05 05:23:03,737 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-05 05:23:03,737 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-05 05:23:03,737 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-05 05:23:03,737 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-05 05:23:03,737 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-05 05:23:03,739 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-04-05 05:23:03,740 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 05:23:03,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:23:03 BasicIcfg [2022-04-05 05:23:03,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 05:23:03,750 INFO L158 Benchmark]: Toolchain (without parser) took 8248.00ms. Allocated memory was 185.6MB in the beginning and 268.4MB in the end (delta: 82.8MB). Free memory was 128.8MB in the beginning and 103.1MB in the end (delta: 25.7MB). Peak memory consumption was 109.4MB. Max. memory is 8.0GB. [2022-04-05 05:23:03,750 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 145.0MB in the beginning and 145.0MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 05:23:03,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.84ms. Allocated memory is still 185.6MB. Free memory was 128.6MB in the beginning and 158.3MB in the end (delta: -29.7MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-04-05 05:23:03,750 INFO L158 Benchmark]: Boogie Preprocessor took 29.45ms. Allocated memory is still 185.6MB. Free memory was 158.3MB in the beginning and 156.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-05 05:23:03,750 INFO L158 Benchmark]: RCFGBuilder took 274.43ms. Allocated memory is still 185.6MB. Free memory was 156.8MB in the beginning and 145.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-05 05:23:03,750 INFO L158 Benchmark]: IcfgTransformer took 29.50ms. Allocated memory is still 185.6MB. Free memory was 145.0MB in the beginning and 143.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-05 05:23:03,751 INFO L158 Benchmark]: TraceAbstraction took 7726.69ms. Allocated memory was 185.6MB in the beginning and 268.4MB in the end (delta: 82.8MB). Free memory was 143.2MB in the beginning and 103.1MB in the end (delta: 40.1MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. [2022-04-05 05:23:03,751 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 185.6MB. Free memory was 145.0MB in the beginning and 145.0MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.84ms. Allocated memory is still 185.6MB. Free memory was 128.6MB in the beginning and 158.3MB in the end (delta: -29.7MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.45ms. Allocated memory is still 185.6MB. Free memory was 158.3MB in the beginning and 156.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 274.43ms. Allocated memory is still 185.6MB. Free memory was 156.8MB in the beginning and 145.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 29.50ms. Allocated memory is still 185.6MB. Free memory was 145.0MB in the beginning and 143.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 7726.69ms. Allocated memory was 185.6MB in the beginning and 268.4MB in the end (delta: 82.8MB). Free memory was 143.2MB in the beginning and 103.1MB in the end (delta: 40.1MB). Peak memory consumption was 123.8MB. 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: 19]: 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 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 649 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 625 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 861 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2875 IncrementalHoareTripleChecker+Invalid, 3736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 861 mSolverCounterUnsat, 299 mSDtfsCounter, 2875 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 893 GetRequests, 699 SyntacticMatches, 14 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=9, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 33 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 60 PreInvPairs, 104 NumberOfFragments, 412 HoareAnnotationTreeSize, 60 FomulaSimplifications, 382 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 2197 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 761 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1050 ConstructedInterpolants, 0 QuantifiedInterpolants, 3625 SizeOfPredicates, 16 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2730/2923 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: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((2 + buflim == bufferlen && in == 0) && 2 <= bufferlen) && buf == 0) && bufferlen < inlen) || ((((((bufferlen + in + 1 <= buf + inlen && buf + 2 <= bufferlen) && 1 <= in) && 0 <= buf) && bufferlen <= 2 + buflim) && bufferlen < inlen) && 2 + buflim <= bufferlen) RESULT: Ultimate proved your program to be correct! [2022-04-05 05:23:03,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...