/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/openssl-simplified/s3_srvr_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 13:38:58,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 13:38:58,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 13:38:58,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 13:38:58,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 13:38:58,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 13:38:58,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 13:38:58,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 13:38:58,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 13:38:58,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 13:38:58,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 13:38:58,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 13:38:58,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 13:38:58,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 13:38:58,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 13:38:58,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 13:38:58,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 13:38:58,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 13:38:58,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 13:38:58,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 13:38:58,648 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 13:38:58,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 13:38:58,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 13:38:58,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 13:38:58,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 13:38:58,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 13:38:58,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 13:38:58,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 13:38:58,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 13:38:58,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 13:38:58,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 13:38:58,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 13:38:58,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 13:38:58,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 13:38:58,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 13:38:58,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 13:38:58,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 13:38:58,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 13:38:58,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 13:38:58,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 13:38:58,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 13:38:58,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 13:38:58,663 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 13:38:58,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 13:38:58,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 13:38:58,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 13:38:58,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 13:38:58,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 13:38:58,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 13:38:58,687 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 13:38:58,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 13:38:58,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 13:38:58,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 13:38:58,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 13:38:58,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 13:38:58,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 13:38:58,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 13:38:58,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 13:38:58,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 13:38:58,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 13:38:58,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 13:38:58,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 13:38:58,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 13:38:58,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 13:38:58,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 13:38:58,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 13:38:58,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 13:38:58,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 13:38:58,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 13:38:58,690 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 13:38:58,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 13:38:58,691 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 13:38:58,691 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-06 13:38:58,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 13:38:58,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 13:38:58,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 13:38:58,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 13:38:58,914 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 13:38:58,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1.cil-2.c [2022-04-06 13:38:58,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e7a67836/81aa45a6e9fe4b128f034ebd9d90861e/FLAG728f293fb [2022-04-06 13:38:59,341 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 13:38:59,342 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1.cil-2.c [2022-04-06 13:38:59,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e7a67836/81aa45a6e9fe4b128f034ebd9d90861e/FLAG728f293fb [2022-04-06 13:38:59,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e7a67836/81aa45a6e9fe4b128f034ebd9d90861e [2022-04-06 13:38:59,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 13:38:59,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 13:38:59,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 13:38:59,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 13:38:59,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 13:38:59,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 01:38:59" (1/1) ... [2022-04-06 13:38:59,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d4d8912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:38:59, skipping insertion in model container [2022-04-06 13:38:59,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 01:38:59" (1/1) ... [2022-04-06 13:38:59,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 13:38:59,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 13:38:59,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1.cil-2.c[43387,43400] [2022-04-06 13:38:59,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 13:38:59,940 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 13:38:59,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1.cil-2.c[43387,43400] [2022-04-06 13:38:59,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 13:39:00,002 INFO L208 MainTranslator]: Completed translation [2022-04-06 13:39:00,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:39:00 WrapperNode [2022-04-06 13:39:00,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 13:39:00,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 13:39:00,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 13:39:00,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 13:39:00,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:39:00" (1/1) ... [2022-04-06 13:39:00,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:39:00" (1/1) ... [2022-04-06 13:39:00,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:39:00" (1/1) ... [2022-04-06 13:39:00,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:39:00" (1/1) ... [2022-04-06 13:39:00,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:39:00" (1/1) ... [2022-04-06 13:39:00,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:39:00" (1/1) ... [2022-04-06 13:39:00,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:39:00" (1/1) ... [2022-04-06 13:39:00,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 13:39:00,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 13:39:00,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 13:39:00,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 13:39:00,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:39:00" (1/1) ... [2022-04-06 13:39:00,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 13:39:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 13:39:00,084 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-06 13:39:00,091 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-06 13:39:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 13:39:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 13:39:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 13:39:00,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-06 13:39:00,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR [2022-04-06 13:39:00,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 13:39:00,117 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 13:39:00,118 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 13:39:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 13:39:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 13:39:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-06 13:39:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 13:39:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-06 13:39:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure ERR [2022-04-06 13:39:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-06 13:39:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 13:39:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 13:39:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 13:39:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 13:39:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 13:39:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 13:39:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 13:39:00,187 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 13:39:00,188 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 13:39:00,261 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-06 13:39:00,492 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-06 13:39:00,492 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-06 13:39:00,498 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 13:39:00,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 13:39:00,504 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 13:39:00,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 01:39:00 BoogieIcfgContainer [2022-04-06 13:39:00,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 13:39:00,506 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 13:39:00,506 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 13:39:00,507 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 13:39:00,509 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 01:39:00" (1/1) ... [2022-04-06 13:39:00,511 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 13:39:00,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 01:39:00 BasicIcfg [2022-04-06 13:39:00,551 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 13:39:00,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 13:39:00,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 13:39:00,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 13:39:00,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 01:38:59" (1/4) ... [2022-04-06 13:39:00,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350d10a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 01:39:00, skipping insertion in model container [2022-04-06 13:39:00,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 01:39:00" (2/4) ... [2022-04-06 13:39:00,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350d10a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 01:39:00, skipping insertion in model container [2022-04-06 13:39:00,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 01:39:00" (3/4) ... [2022-04-06 13:39:00,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350d10a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 01:39:00, skipping insertion in model container [2022-04-06 13:39:00,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 01:39:00" (4/4) ... [2022-04-06 13:39:00,581 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.cqvasr [2022-04-06 13:39:00,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 13:39:00,585 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 13:39:00,622 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 13:39:00,627 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-06 13:39:00,627 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 13:39:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 145 states have (on average 1.696551724137931) internal successors, (246), 147 states have internal predecessors, (246), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 13:39:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-06 13:39:00,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:00,648 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:00,648 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:00,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash 270340497, now seen corresponding path program 1 times [2022-04-06 13:39:00,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:00,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938314761] [2022-04-06 13:39:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:00,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:00,891 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-06 13:39:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:00,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938314761] [2022-04-06 13:39:00,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938314761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:00,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:00,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:00,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670324058] [2022-04-06 13:39:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:00,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:00,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:00,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:00,927 INFO L87 Difference]: Start difference. First operand has 155 states, 145 states have (on average 1.696551724137931) internal successors, (246), 147 states have internal predecessors, (246), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:01,272 INFO L93 Difference]: Finished difference Result 424 states and 712 transitions. [2022-04-06 13:39:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:01,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-06 13:39:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:01,288 INFO L225 Difference]: With dead ends: 424 [2022-04-06 13:39:01,288 INFO L226 Difference]: Without dead ends: 256 [2022-04-06 13:39:01,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:01,296 INFO L913 BasicCegarLoop]: 242 mSDtfsCounter, 637 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:01,297 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 251 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-06 13:39:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-04-06 13:39:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 250 states have (on average 1.52) internal successors, (380), 250 states have internal predecessors, (380), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2022-04-06 13:39:01,349 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 52 [2022-04-06 13:39:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:01,350 INFO L478 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2022-04-06 13:39:01,350 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2022-04-06 13:39:01,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-06 13:39:01,352 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:01,352 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:01,353 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 13:39:01,353 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1820054526, now seen corresponding path program 1 times [2022-04-06 13:39:01,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:01,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352389207] [2022-04-06 13:39:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:01,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 13:39:01,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:01,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352389207] [2022-04-06 13:39:01,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352389207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:01,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:01,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:01,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369570358] [2022-04-06 13:39:01,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:01,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:01,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:01,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:01,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:01,427 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:01,643 INFO L93 Difference]: Finished difference Result 408 states and 622 transitions. [2022-04-06 13:39:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:01,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-06 13:39:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:01,645 INFO L225 Difference]: With dead ends: 408 [2022-04-06 13:39:01,646 INFO L226 Difference]: Without dead ends: 285 [2022-04-06 13:39:01,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:01,647 INFO L913 BasicCegarLoop]: 217 mSDtfsCounter, 218 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:01,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 224 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-04-06 13:39:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 277. [2022-04-06 13:39:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 271 states have (on average 1.4981549815498154) internal successors, (406), 271 states have internal predecessors, (406), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 411 transitions. [2022-04-06 13:39:01,662 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 411 transitions. Word has length 68 [2022-04-06 13:39:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:01,662 INFO L478 AbstractCegarLoop]: Abstraction has 277 states and 411 transitions. [2022-04-06 13:39:01,663 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 411 transitions. [2022-04-06 13:39:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-06 13:39:01,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:01,665 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:01,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 13:39:01,665 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:01,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1118947656, now seen corresponding path program 1 times [2022-04-06 13:39:01,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:01,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302543880] [2022-04-06 13:39:01,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:01,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:01,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-06 13:39:01,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:01,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302543880] [2022-04-06 13:39:01,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302543880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:01,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:01,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:01,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797688631] [2022-04-06 13:39:01,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:01,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:01,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:01,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:01,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:01,742 INFO L87 Difference]: Start difference. First operand 277 states and 411 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:01,958 INFO L93 Difference]: Finished difference Result 632 states and 969 transitions. [2022-04-06 13:39:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:01,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-06 13:39:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:01,962 INFO L225 Difference]: With dead ends: 632 [2022-04-06 13:39:01,962 INFO L226 Difference]: Without dead ends: 369 [2022-04-06 13:39:01,965 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:01,969 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 219 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:01,971 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 225 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-06 13:39:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2022-04-06 13:39:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 355 states have (on average 1.408450704225352) internal successors, (500), 355 states have internal predecessors, (500), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 505 transitions. [2022-04-06 13:39:01,996 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 505 transitions. Word has length 89 [2022-04-06 13:39:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:01,997 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 505 transitions. [2022-04-06 13:39:01,997 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 505 transitions. [2022-04-06 13:39:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-06 13:39:02,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:02,004 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:02,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 13:39:02,004 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:02,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2143641577, now seen corresponding path program 1 times [2022-04-06 13:39:02,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:02,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001994459] [2022-04-06 13:39:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:02,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:02,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-06 13:39:02,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:02,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001994459] [2022-04-06 13:39:02,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001994459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:02,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:02,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304552066] [2022-04-06 13:39:02,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:02,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:02,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:02,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:02,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:02,102 INFO L87 Difference]: Start difference. First operand 361 states and 505 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:02,283 INFO L93 Difference]: Finished difference Result 762 states and 1086 transitions. [2022-04-06 13:39:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:02,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-06 13:39:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:02,286 INFO L225 Difference]: With dead ends: 762 [2022-04-06 13:39:02,287 INFO L226 Difference]: Without dead ends: 415 [2022-04-06 13:39:02,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:02,295 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 217 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:02,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 225 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-04-06 13:39:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 407. [2022-04-06 13:39:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 401 states have (on average 1.3865336658354115) internal successors, (556), 401 states have internal predecessors, (556), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 561 transitions. [2022-04-06 13:39:02,311 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 561 transitions. Word has length 89 [2022-04-06 13:39:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:02,311 INFO L478 AbstractCegarLoop]: Abstraction has 407 states and 561 transitions. [2022-04-06 13:39:02,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 561 transitions. [2022-04-06 13:39:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-06 13:39:02,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:02,313 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:02,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 13:39:02,314 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:02,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1568616926, now seen corresponding path program 1 times [2022-04-06 13:39:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:02,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787012303] [2022-04-06 13:39:02,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:02,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-06 13:39:02,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:02,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787012303] [2022-04-06 13:39:02,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787012303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:02,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:02,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260021184] [2022-04-06 13:39:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:02,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:02,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:02,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:02,388 INFO L87 Difference]: Start difference. First operand 407 states and 561 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:02,602 INFO L93 Difference]: Finished difference Result 876 states and 1238 transitions. [2022-04-06 13:39:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:02,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-06 13:39:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:02,605 INFO L225 Difference]: With dead ends: 876 [2022-04-06 13:39:02,605 INFO L226 Difference]: Without dead ends: 483 [2022-04-06 13:39:02,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:02,607 INFO L913 BasicCegarLoop]: 217 mSDtfsCounter, 249 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:02,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 224 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-04-06 13:39:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 457. [2022-04-06 13:39:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 451 states have (on average 1.3658536585365855) internal successors, (616), 451 states have internal predecessors, (616), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 621 transitions. [2022-04-06 13:39:02,632 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 621 transitions. Word has length 110 [2022-04-06 13:39:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:02,632 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 621 transitions. [2022-04-06 13:39:02,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 621 transitions. [2022-04-06 13:39:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-06 13:39:02,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:02,634 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:02,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 13:39:02,634 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:02,634 INFO L85 PathProgramCache]: Analyzing trace with hash 710803079, now seen corresponding path program 1 times [2022-04-06 13:39:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:02,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377573198] [2022-04-06 13:39:02,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:02,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:02,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-06 13:39:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:02,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377573198] [2022-04-06 13:39:02,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377573198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:02,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:02,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224458756] [2022-04-06 13:39:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:02,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:02,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:02,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:02,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:02,681 INFO L87 Difference]: Start difference. First operand 457 states and 621 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:02,851 INFO L93 Difference]: Finished difference Result 918 states and 1252 transitions. [2022-04-06 13:39:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-06 13:39:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:02,853 INFO L225 Difference]: With dead ends: 918 [2022-04-06 13:39:02,853 INFO L226 Difference]: Without dead ends: 684 [2022-04-06 13:39:02,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:02,855 INFO L913 BasicCegarLoop]: 374 mSDtfsCounter, 334 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:02,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 381 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 13:39:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-04-06 13:39:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2022-04-06 13:39:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 678 states have (on average 1.359882005899705) internal successors, (922), 678 states have internal predecessors, (922), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 927 transitions. [2022-04-06 13:39:02,870 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 927 transitions. Word has length 129 [2022-04-06 13:39:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:02,870 INFO L478 AbstractCegarLoop]: Abstraction has 684 states and 927 transitions. [2022-04-06 13:39:02,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 927 transitions. [2022-04-06 13:39:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-06 13:39:02,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:02,872 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:02,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 13:39:02,872 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:02,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash -989937400, now seen corresponding path program 1 times [2022-04-06 13:39:02,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:02,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443658971] [2022-04-06 13:39:02,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-06 13:39:02,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443658971] [2022-04-06 13:39:02,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443658971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:02,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:02,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000445262] [2022-04-06 13:39:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:02,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:02,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:02,924 INFO L87 Difference]: Start difference. First operand 684 states and 927 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:03,112 INFO L93 Difference]: Finished difference Result 1374 states and 1867 transitions. [2022-04-06 13:39:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:03,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-06 13:39:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:03,116 INFO L225 Difference]: With dead ends: 1374 [2022-04-06 13:39:03,116 INFO L226 Difference]: Without dead ends: 913 [2022-04-06 13:39:03,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:03,118 INFO L913 BasicCegarLoop]: 377 mSDtfsCounter, 336 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:03,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 384 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2022-04-06 13:39:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2022-04-06 13:39:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 907 states have (on average 1.3572216097023153) internal successors, (1231), 907 states have internal predecessors, (1231), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1236 transitions. [2022-04-06 13:39:03,142 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1236 transitions. Word has length 129 [2022-04-06 13:39:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:03,143 INFO L478 AbstractCegarLoop]: Abstraction has 913 states and 1236 transitions. [2022-04-06 13:39:03,143 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1236 transitions. [2022-04-06 13:39:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-06 13:39:03,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:03,146 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:03,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-06 13:39:03,147 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash 178258855, now seen corresponding path program 1 times [2022-04-06 13:39:03,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:03,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678798344] [2022-04-06 13:39:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:03,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-06 13:39:03,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:03,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678798344] [2022-04-06 13:39:03,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678798344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:03,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:03,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042309965] [2022-04-06 13:39:03,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:03,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:03,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:03,210 INFO L87 Difference]: Start difference. First operand 913 states and 1236 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:03,369 INFO L93 Difference]: Finished difference Result 1627 states and 2200 transitions. [2022-04-06 13:39:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:03,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-06 13:39:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:03,372 INFO L225 Difference]: With dead ends: 1627 [2022-04-06 13:39:03,372 INFO L226 Difference]: Without dead ends: 937 [2022-04-06 13:39:03,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:03,375 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 210 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:03,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 239 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 13:39:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-04-06 13:39:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2022-04-06 13:39:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 931 states have (on average 1.3533834586466165) internal successors, (1260), 931 states have internal predecessors, (1260), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1265 transitions. [2022-04-06 13:39:03,393 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1265 transitions. Word has length 129 [2022-04-06 13:39:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:03,393 INFO L478 AbstractCegarLoop]: Abstraction has 937 states and 1265 transitions. [2022-04-06 13:39:03,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1265 transitions. [2022-04-06 13:39:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-06 13:39:03,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:03,396 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:03,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-06 13:39:03,396 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash 123134098, now seen corresponding path program 1 times [2022-04-06 13:39:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:03,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528001774] [2022-04-06 13:39:03,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:03,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-06 13:39:03,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:03,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528001774] [2022-04-06 13:39:03,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528001774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:03,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:03,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974282079] [2022-04-06 13:39:03,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:03,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:03,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:03,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:03,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:03,459 INFO L87 Difference]: Start difference. First operand 937 states and 1265 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:03,669 INFO L93 Difference]: Finished difference Result 2029 states and 2807 transitions. [2022-04-06 13:39:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 167 [2022-04-06 13:39:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:03,673 INFO L225 Difference]: With dead ends: 2029 [2022-04-06 13:39:03,673 INFO L226 Difference]: Without dead ends: 1106 [2022-04-06 13:39:03,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:03,675 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 242 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:03,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 222 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-04-06 13:39:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1060. [2022-04-06 13:39:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1054 states have (on average 1.3349146110056926) internal successors, (1407), 1054 states have internal predecessors, (1407), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1412 transitions. [2022-04-06 13:39:03,695 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1412 transitions. Word has length 167 [2022-04-06 13:39:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:03,696 INFO L478 AbstractCegarLoop]: Abstraction has 1060 states and 1412 transitions. [2022-04-06 13:39:03,696 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1412 transitions. [2022-04-06 13:39:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-06 13:39:03,698 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:03,698 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:03,698 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-06 13:39:03,699 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:03,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:03,699 INFO L85 PathProgramCache]: Analyzing trace with hash -256620717, now seen corresponding path program 1 times [2022-04-06 13:39:03,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:03,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150344204] [2022-04-06 13:39:03,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:03,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:03,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-06 13:39:03,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:03,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150344204] [2022-04-06 13:39:03,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150344204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:03,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:03,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:03,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890760969] [2022-04-06 13:39:03,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:03,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:03,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:03,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:03,735 INFO L87 Difference]: Start difference. First operand 1060 states and 1412 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:03,899 INFO L93 Difference]: Finished difference Result 2335 states and 3201 transitions. [2022-04-06 13:39:03,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:03,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 181 [2022-04-06 13:39:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:03,904 INFO L225 Difference]: With dead ends: 2335 [2022-04-06 13:39:03,904 INFO L226 Difference]: Without dead ends: 1285 [2022-04-06 13:39:03,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:03,907 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 338 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:03,907 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 223 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 13:39:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2022-04-06 13:39:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1264. [2022-04-06 13:39:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1258 states have (on average 1.3879173290937996) internal successors, (1746), 1258 states have internal predecessors, (1746), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1751 transitions. [2022-04-06 13:39:03,933 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1751 transitions. Word has length 181 [2022-04-06 13:39:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:03,934 INFO L478 AbstractCegarLoop]: Abstraction has 1264 states and 1751 transitions. [2022-04-06 13:39:03,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1751 transitions. [2022-04-06 13:39:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-04-06 13:39:03,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:03,937 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:03,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-06 13:39:03,937 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:03,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash -863922344, now seen corresponding path program 1 times [2022-04-06 13:39:03,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:03,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463046415] [2022-04-06 13:39:03,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:03,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:03,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-04-06 13:39:03,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:03,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463046415] [2022-04-06 13:39:03,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463046415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:03,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:03,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:03,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650107124] [2022-04-06 13:39:03,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:03,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:03,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:03,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:03,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:03,984 INFO L87 Difference]: Start difference. First operand 1264 states and 1751 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:04,173 INFO L93 Difference]: Finished difference Result 2638 states and 3704 transitions. [2022-04-06 13:39:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:04,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 210 [2022-04-06 13:39:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:04,178 INFO L225 Difference]: With dead ends: 2638 [2022-04-06 13:39:04,178 INFO L226 Difference]: Without dead ends: 1388 [2022-04-06 13:39:04,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:04,180 INFO L913 BasicCegarLoop]: 205 mSDtfsCounter, 224 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:04,181 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 212 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2022-04-06 13:39:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1388. [2022-04-06 13:39:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1382 states have (on average 1.3675832127351664) internal successors, (1890), 1382 states have internal predecessors, (1890), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1895 transitions. [2022-04-06 13:39:04,208 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1895 transitions. Word has length 210 [2022-04-06 13:39:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:04,208 INFO L478 AbstractCegarLoop]: Abstraction has 1388 states and 1895 transitions. [2022-04-06 13:39:04,209 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1895 transitions. [2022-04-06 13:39:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-04-06 13:39:04,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:04,212 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:04,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-06 13:39:04,212 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1363637268, now seen corresponding path program 1 times [2022-04-06 13:39:04,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:04,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207656960] [2022-04-06 13:39:04,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:04,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:04,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-04-06 13:39:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:04,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207656960] [2022-04-06 13:39:04,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207656960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:04,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:04,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:04,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709204078] [2022-04-06 13:39:04,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:04,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:04,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:04,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:04,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:04,274 INFO L87 Difference]: Start difference. First operand 1388 states and 1895 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:04,482 INFO L93 Difference]: Finished difference Result 2930 states and 4076 transitions. [2022-04-06 13:39:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:04,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 239 [2022-04-06 13:39:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:04,487 INFO L225 Difference]: With dead ends: 2930 [2022-04-06 13:39:04,487 INFO L226 Difference]: Without dead ends: 1381 [2022-04-06 13:39:04,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:04,491 INFO L913 BasicCegarLoop]: 217 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:04,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 224 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2022-04-06 13:39:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2022-04-06 13:39:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1375 states have (on average 1.3614545454545455) internal successors, (1872), 1375 states have internal predecessors, (1872), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1877 transitions. [2022-04-06 13:39:04,522 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1877 transitions. Word has length 239 [2022-04-06 13:39:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:04,523 INFO L478 AbstractCegarLoop]: Abstraction has 1381 states and 1877 transitions. [2022-04-06 13:39:04,523 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1877 transitions. [2022-04-06 13:39:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-04-06 13:39:04,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:04,527 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:04,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-06 13:39:04,527 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:04,528 INFO L85 PathProgramCache]: Analyzing trace with hash 667275459, now seen corresponding path program 1 times [2022-04-06 13:39:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:04,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19707870] [2022-04-06 13:39:04,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:04,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-06 13:39:04,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:04,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19707870] [2022-04-06 13:39:04,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19707870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:04,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:04,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:04,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808438790] [2022-04-06 13:39:04,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:04,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:04,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:04,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:04,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:04,585 INFO L87 Difference]: Start difference. First operand 1381 states and 1877 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:04,772 INFO L93 Difference]: Finished difference Result 3970 states and 5426 transitions. [2022-04-06 13:39:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 279 [2022-04-06 13:39:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:04,778 INFO L225 Difference]: With dead ends: 3970 [2022-04-06 13:39:04,778 INFO L226 Difference]: Without dead ends: 1661 [2022-04-06 13:39:04,781 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:04,782 INFO L913 BasicCegarLoop]: 377 mSDtfsCounter, 320 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:04,782 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 384 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 13:39:04,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2022-04-06 13:39:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1660. [2022-04-06 13:39:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1654 states have (on average 1.3627569528415961) internal successors, (2254), 1654 states have internal predecessors, (2254), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2259 transitions. [2022-04-06 13:39:04,814 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2259 transitions. Word has length 279 [2022-04-06 13:39:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:04,814 INFO L478 AbstractCegarLoop]: Abstraction has 1660 states and 2259 transitions. [2022-04-06 13:39:04,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2259 transitions. [2022-04-06 13:39:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-04-06 13:39:04,818 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:04,818 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:04,818 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-06 13:39:04,818 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:04,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1950874894, now seen corresponding path program 1 times [2022-04-06 13:39:04,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:04,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35275112] [2022-04-06 13:39:04,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:04,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:04,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2022-04-06 13:39:04,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:04,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35275112] [2022-04-06 13:39:04,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35275112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:04,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:04,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:04,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639129091] [2022-04-06 13:39:04,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:04,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:04,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:04,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:04,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:04,860 INFO L87 Difference]: Start difference. First operand 1660 states and 2259 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:05,052 INFO L93 Difference]: Finished difference Result 3481 states and 4795 transitions. [2022-04-06 13:39:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:05,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 326 [2022-04-06 13:39:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:05,057 INFO L225 Difference]: With dead ends: 3481 [2022-04-06 13:39:05,058 INFO L226 Difference]: Without dead ends: 1835 [2022-04-06 13:39:05,060 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:05,061 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 227 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:05,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 221 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-04-06 13:39:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1795. [2022-04-06 13:39:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1789 states have (on average 1.349357182783678) internal successors, (2414), 1789 states have internal predecessors, (2414), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2419 transitions. [2022-04-06 13:39:05,124 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2419 transitions. Word has length 326 [2022-04-06 13:39:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:05,125 INFO L478 AbstractCegarLoop]: Abstraction has 1795 states and 2419 transitions. [2022-04-06 13:39:05,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2419 transitions. [2022-04-06 13:39:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2022-04-06 13:39:05,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:05,129 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:05,129 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-06 13:39:05,129 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:05,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash -199601085, now seen corresponding path program 1 times [2022-04-06 13:39:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:05,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101260297] [2022-04-06 13:39:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2022-04-06 13:39:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:05,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101260297] [2022-04-06 13:39:05,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101260297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:05,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:05,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:05,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709492320] [2022-04-06 13:39:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:05,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:05,176 INFO L87 Difference]: Start difference. First operand 1795 states and 2419 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:05,397 INFO L93 Difference]: Finished difference Result 3731 states and 5080 transitions. [2022-04-06 13:39:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 349 [2022-04-06 13:39:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:05,403 INFO L225 Difference]: With dead ends: 3731 [2022-04-06 13:39:05,403 INFO L226 Difference]: Without dead ends: 1950 [2022-04-06 13:39:05,407 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:05,408 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:05,408 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 221 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2022-04-06 13:39:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1940. [2022-04-06 13:39:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1934 states have (on average 1.3360910031023785) internal successors, (2584), 1934 states have internal predecessors, (2584), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2589 transitions. [2022-04-06 13:39:05,447 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2589 transitions. Word has length 349 [2022-04-06 13:39:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:05,447 INFO L478 AbstractCegarLoop]: Abstraction has 1940 states and 2589 transitions. [2022-04-06 13:39:05,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2589 transitions. [2022-04-06 13:39:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2022-04-06 13:39:05,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:05,453 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:05,454 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-06 13:39:05,454 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:05,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2033863307, now seen corresponding path program 1 times [2022-04-06 13:39:05,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:05,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480131885] [2022-04-06 13:39:05,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:05,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:05,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2022-04-06 13:39:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:05,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480131885] [2022-04-06 13:39:05,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480131885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 13:39:05,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14271393] [2022-04-06 13:39:05,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:05,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 13:39:05,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 13:39:05,528 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-06 13:39:05,555 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-06 13:39:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:05,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-06 13:39:05,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 13:39:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2022-04-06 13:39:06,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 13:39:06,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14271393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:06,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 13:39:06,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-06 13:39:06,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339527764] [2022-04-06 13:39:06,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:06,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 13:39:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 13:39:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 13:39:06,225 INFO L87 Difference]: Start difference. First operand 1940 states and 2589 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:06,282 INFO L93 Difference]: Finished difference Result 2729 states and 3640 transitions. [2022-04-06 13:39:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 13:39:06,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 383 [2022-04-06 13:39:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:06,290 INFO L225 Difference]: With dead ends: 2729 [2022-04-06 13:39:06,290 INFO L226 Difference]: Without dead ends: 2726 [2022-04-06 13:39:06,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 13:39:06,292 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 139 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:06,292 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 374 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 13:39:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2022-04-06 13:39:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2726. [2022-04-06 13:39:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 2720 states have (on average 1.3349264705882353) internal successors, (3631), 2720 states have internal predecessors, (3631), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3636 transitions. [2022-04-06 13:39:06,343 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3636 transitions. Word has length 383 [2022-04-06 13:39:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:06,343 INFO L478 AbstractCegarLoop]: Abstraction has 2726 states and 3636 transitions. [2022-04-06 13:39:06,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3636 transitions. [2022-04-06 13:39:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2022-04-06 13:39:06,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:06,350 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:06,373 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-06 13:39:06,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-06 13:39:06,571 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:06,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1809069780, now seen corresponding path program 1 times [2022-04-06 13:39:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:06,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967026171] [2022-04-06 13:39:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:06,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-04-06 13:39:06,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:06,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967026171] [2022-04-06 13:39:06,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967026171] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 13:39:06,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887511104] [2022-04-06 13:39:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:06,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 13:39:06,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 13:39:06,634 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-06 13:39:06,635 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-06 13:39:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:06,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 13:39:06,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 13:39:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2022-04-06 13:39:07,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 13:39:07,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887511104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:07,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 13:39:07,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-06 13:39:07,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119909887] [2022-04-06 13:39:07,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:07,496 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 13:39:07,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:07,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 13:39:07,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 13:39:07,496 INFO L87 Difference]: Start difference. First operand 2726 states and 3636 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:07,547 INFO L93 Difference]: Finished difference Result 3074 states and 4104 transitions. [2022-04-06 13:39:07,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 13:39:07,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 454 [2022-04-06 13:39:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:07,555 INFO L225 Difference]: With dead ends: 3074 [2022-04-06 13:39:07,555 INFO L226 Difference]: Without dead ends: 2313 [2022-04-06 13:39:07,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 13:39:07,557 INFO L913 BasicCegarLoop]: 371 mSDtfsCounter, 100 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:07,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 560 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 13:39:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2022-04-06 13:39:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1968. [2022-04-06 13:39:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1962 states have (on average 1.3363914373088686) internal successors, (2622), 1962 states have internal predecessors, (2622), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2627 transitions. [2022-04-06 13:39:07,643 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2627 transitions. Word has length 454 [2022-04-06 13:39:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:07,643 INFO L478 AbstractCegarLoop]: Abstraction has 1968 states and 2627 transitions. [2022-04-06 13:39:07,643 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2627 transitions. [2022-04-06 13:39:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2022-04-06 13:39:07,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:07,651 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:07,671 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-06 13:39:07,863 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,SelfDestructingSolverStorable16 [2022-04-06 13:39:07,863 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:07,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash 853548501, now seen corresponding path program 1 times [2022-04-06 13:39:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:07,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207117137] [2022-04-06 13:39:07,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:07,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:07,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-04-06 13:39:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:07,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207117137] [2022-04-06 13:39:07,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207117137] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 13:39:07,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801985952] [2022-04-06 13:39:07,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:07,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 13:39:07,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 13:39:07,932 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-06 13:39:07,933 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-06 13:39:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:08,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 13:39:08,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 13:39:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-04-06 13:39:08,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 13:39:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-04-06 13:39:08,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801985952] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 13:39:08,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 13:39:08,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-06 13:39:08,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2355266] [2022-04-06 13:39:08,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 13:39:08,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 13:39:08,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 13:39:08,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 13:39:08,946 INFO L87 Difference]: Start difference. First operand 1968 states and 2627 transitions. Second operand has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 6 states have internal predecessors, (250), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:09,579 INFO L93 Difference]: Finished difference Result 4656 states and 6319 transitions. [2022-04-06 13:39:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 13:39:09,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 6 states have internal predecessors, (250), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 454 [2022-04-06 13:39:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:09,587 INFO L225 Difference]: With dead ends: 4656 [2022-04-06 13:39:09,587 INFO L226 Difference]: Without dead ends: 2569 [2022-04-06 13:39:09,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 923 GetRequests, 913 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-06 13:39:09,591 INFO L913 BasicCegarLoop]: 304 mSDtfsCounter, 529 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:09,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 326 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 13:39:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2022-04-06 13:39:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 1987. [2022-04-06 13:39:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1981 states have (on average 1.331145885916204) internal successors, (2637), 1981 states have internal predecessors, (2637), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2642 transitions. [2022-04-06 13:39:09,641 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2642 transitions. Word has length 454 [2022-04-06 13:39:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:09,641 INFO L478 AbstractCegarLoop]: Abstraction has 1987 states and 2642 transitions. [2022-04-06 13:39:09,642 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 6 states have internal predecessors, (250), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2642 transitions. [2022-04-06 13:39:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2022-04-06 13:39:09,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:09,652 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 12, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:09,673 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-06 13:39:09,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-06 13:39:09,867 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:09,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -402012141, now seen corresponding path program 1 times [2022-04-06 13:39:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:09,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169121385] [2022-04-06 13:39:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:09,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4562 backedges. 2170 proven. 0 refuted. 0 times theorem prover too weak. 2392 trivial. 0 not checked. [2022-04-06 13:39:09,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:09,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169121385] [2022-04-06 13:39:09,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169121385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:09,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:09,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:09,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17494397] [2022-04-06 13:39:09,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:09,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:09,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:09,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:09,940 INFO L87 Difference]: Start difference. First operand 1987 states and 2642 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:10,153 INFO L93 Difference]: Finished difference Result 4176 states and 5638 transitions. [2022-04-06 13:39:10,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:10,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 663 [2022-04-06 13:39:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:10,160 INFO L225 Difference]: With dead ends: 4176 [2022-04-06 13:39:10,160 INFO L226 Difference]: Without dead ends: 2203 [2022-04-06 13:39:10,163 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:10,164 INFO L913 BasicCegarLoop]: 212 mSDtfsCounter, 206 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:10,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 219 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2022-04-06 13:39:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2191. [2022-04-06 13:39:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2191 states, 2185 states have (on average 1.31395881006865) internal successors, (2871), 2185 states have internal predecessors, (2871), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 2876 transitions. [2022-04-06 13:39:10,207 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 2876 transitions. Word has length 663 [2022-04-06 13:39:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:10,207 INFO L478 AbstractCegarLoop]: Abstraction has 2191 states and 2876 transitions. [2022-04-06 13:39:10,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2876 transitions. [2022-04-06 13:39:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2022-04-06 13:39:10,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:10,214 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 21, 21, 20, 20, 19, 19, 18, 18, 18, 18, 15, 12, 12, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:10,214 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-06 13:39:10,215 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:10,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1249705316, now seen corresponding path program 1 times [2022-04-06 13:39:10,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:10,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458825723] [2022-04-06 13:39:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:10,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:10,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2953 proven. 0 refuted. 0 times theorem prover too weak. 3223 trivial. 0 not checked. [2022-04-06 13:39:10,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:10,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458825723] [2022-04-06 13:39:10,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458825723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 13:39:10,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 13:39:10,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 13:39:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585142314] [2022-04-06 13:39:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 13:39:10,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 13:39:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:10,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 13:39:10,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 13:39:10,315 INFO L87 Difference]: Start difference. First operand 2191 states and 2876 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:10,526 INFO L93 Difference]: Finished difference Result 4596 states and 6130 transitions. [2022-04-06 13:39:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 13:39:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 756 [2022-04-06 13:39:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:10,540 INFO L225 Difference]: With dead ends: 4596 [2022-04-06 13:39:10,540 INFO L226 Difference]: Without dead ends: 2419 [2022-04-06 13:39:10,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 13:39:10,544 INFO L913 BasicCegarLoop]: 212 mSDtfsCounter, 206 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:10,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 219 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 13:39:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2022-04-06 13:39:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2407. [2022-04-06 13:39:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2401 states have (on average 1.2982090795501875) internal successors, (3117), 2401 states have internal predecessors, (3117), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 3122 transitions. [2022-04-06 13:39:10,594 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 3122 transitions. Word has length 756 [2022-04-06 13:39:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:10,595 INFO L478 AbstractCegarLoop]: Abstraction has 2407 states and 3122 transitions. [2022-04-06 13:39:10,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 3122 transitions. [2022-04-06 13:39:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2022-04-06 13:39:10,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 13:39:10,603 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:10,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-06 13:39:10,604 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ERRErr0ASSERT_VIOLATIONERROR_FUNCTION === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 13:39:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 13:39:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -783438281, now seen corresponding path program 1 times [2022-04-06 13:39:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 13:39:10,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331005924] [2022-04-06 13:39:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 13:39:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 13:39:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-04-06 13:39:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 13:39:10,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331005924] [2022-04-06 13:39:10,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331005924] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 13:39:10,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002041348] [2022-04-06 13:39:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 13:39:10,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 13:39:10,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 13:39:10,726 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-06 13:39:10,727 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-06 13:39:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 13:39:10,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 13:39:10,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 13:39:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-04-06 13:39:11,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 13:39:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-04-06 13:39:12,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002041348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 13:39:12,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 13:39:12,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-06 13:39:12,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071923388] [2022-04-06 13:39:12,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 13:39:12,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 13:39:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 13:39:12,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 13:39:12,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-06 13:39:12,636 INFO L87 Difference]: Start difference. First operand 2407 states and 3122 transitions. Second operand has 9 states, 9 states have (on average 39.111111111111114) internal successors, (352), 8 states have internal predecessors, (352), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 13:39:13,231 INFO L93 Difference]: Finished difference Result 4210 states and 5517 transitions. [2022-04-06 13:39:13,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 13:39:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 39.111111111111114) internal successors, (352), 8 states have internal predecessors, (352), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 855 [2022-04-06 13:39:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 13:39:13,232 INFO L225 Difference]: With dead ends: 4210 [2022-04-06 13:39:13,232 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 13:39:13,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1723 GetRequests, 1712 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-04-06 13:39:13,237 INFO L913 BasicCegarLoop]: 300 mSDtfsCounter, 411 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 13:39:13,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 317 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 13:39:13,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 13:39:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 13:39:13,238 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-06 13:39:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 13:39:13,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 855 [2022-04-06 13:39:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 13:39:13,238 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 13:39:13,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.111111111111114) internal successors, (352), 8 states have internal predecessors, (352), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 13:39:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 13:39:13,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 13:39:13,241 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ERRErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 13:39:13,262 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-06 13:39:13,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 13:39:13,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 13:39:16,096 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-06 13:39:16,096 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-06 13:39:16,096 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-06 13:39:16,096 INFO L885 garLoopResultBuilder]: At program point ERRENTRY(lines 629 632) the Hoare annotation is: true [2022-04-06 13:39:16,096 INFO L882 garLoopResultBuilder]: For program point ERRErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-04-06 13:39:16,096 INFO L882 garLoopResultBuilder]: For program point ERRFINAL(lines 629 632) no Hoare annotation was computed. [2022-04-06 13:39:16,096 INFO L882 garLoopResultBuilder]: For program point ERREXIT(lines 629 632) no Hoare annotation was computed. [2022-04-06 13:39:16,096 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 13:39:16,096 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-06 13:39:16,096 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-06 13:39:16,096 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-06 13:39:16,096 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 633 644) the Hoare annotation is: true [2022-04-06 13:39:16,097 INFO L885 garLoopResultBuilder]: At program point L640(line 640) the Hoare annotation is: true [2022-04-06 13:39:16,097 INFO L882 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2022-04-06 13:39:16,097 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 633 644) no Hoare annotation was computed. [2022-04-06 13:39:16,097 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 633 644) no Hoare annotation was computed. [2022-04-06 13:39:16,097 INFO L885 garLoopResultBuilder]: At program point ssl3_acceptENTRY(lines 23 627) the Hoare annotation is: true [2022-04-06 13:39:16,097 INFO L882 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-04-06 13:39:16,097 INFO L882 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-04-06 13:39:16,097 INFO L882 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-04-06 13:39:16,097 INFO L882 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-04-06 13:39:16,097 INFO L882 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-04-06 13:39:16,097 INFO L882 garLoopResultBuilder]: For program point L101-1(lines 84 626) no Hoare annotation was computed. [2022-04-06 13:39:16,097 INFO L882 garLoopResultBuilder]: For program point ssl3_acceptFINAL(lines 23 627) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L878 garLoopResultBuilder]: At program point L110-2(lines 110 614) the Hoare annotation is: (let ((.cse3 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= 3 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (= 2 ssl3_accept_~blastFlag~0))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse1 .cse2) (and .cse3 (<= ssl3_accept_~s__state~0 8672) (<= 8672 ssl3_accept_~s__state~0) .cse2) (and .cse0 .cse3 (< ssl3_accept_~s__state~0 8656)) (and (= ssl3_accept_~s__state~0 8656) .cse0 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2) (= ssl3_accept_~s__state~0 3) (and .cse0 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse0))) [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point ssl3_acceptEXIT(lines 23 627) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L885 garLoopResultBuilder]: At program point L615(lines 109 616) the Hoare annotation is: true [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L113(lines 113 595) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L620-2(lines 620 622) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L878 garLoopResultBuilder]: At program point L114(lines 113 595) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= 8672 ssl3_accept_~s__state~0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) .cse1 .cse0) (and .cse1 .cse0 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L116(lines 116 594) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L878 garLoopResultBuilder]: At program point L222(lines 116 594) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (= ssl3_accept_~blastFlag~0 0) (and (< ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L119(lines 119 593) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L122(lines 122 592) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L125(lines 125 591) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-04-06 13:39:16,098 INFO L882 garLoopResultBuilder]: For program point L128(lines 128 590) no Hoare annotation was computed. [2022-04-06 13:39:16,099 INFO L882 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2022-04-06 13:39:16,099 INFO L878 garLoopResultBuilder]: At program point L132(lines 128 590) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse3 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 (not (<= 8576 ssl3_accept_~s__state~0))) (and (< ssl3_accept_~s__state~0 8576) .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3))) [2022-04-06 13:39:16,099 INFO L882 garLoopResultBuilder]: For program point L131(lines 131 589) no Hoare annotation was computed. [2022-04-06 13:39:16,099 INFO L882 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-04-06 13:39:16,099 INFO L882 garLoopResultBuilder]: For program point L237-2(lines 237 244) no Hoare annotation was computed. [2022-04-06 13:39:16,099 INFO L882 garLoopResultBuilder]: For program point L268(lines 268 270) no Hoare annotation was computed. [2022-04-06 13:39:16,099 INFO L882 garLoopResultBuilder]: For program point L134(lines 134 588) no Hoare annotation was computed. [2022-04-06 13:39:16,101 INFO L882 garLoopResultBuilder]: For program point L246(lines 246 249) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L878 garLoopResultBuilder]: At program point L559(lines 110 614) the Hoare annotation is: (let ((.cse3 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= 3 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (= 2 ssl3_accept_~blastFlag~0))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse1 .cse2) (and .cse3 (<= ssl3_accept_~s__state~0 8672) (<= 8672 ssl3_accept_~s__state~0) .cse2) (and .cse0 .cse3 (< ssl3_accept_~s__state~0 8656)) (and (= ssl3_accept_~s__state~0 8656) .cse0 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2) (= ssl3_accept_~s__state~0 3) (and .cse0 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse0))) [2022-04-06 13:39:16,102 INFO L878 garLoopResultBuilder]: At program point L135(lines 134 588) the Hoare annotation is: (<= ssl3_accept_~s__state~0 8672) [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L137(lines 137 587) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L251(lines 251 262) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L597(lines 597 611) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L596(lines 596 612) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L878 garLoopResultBuilder]: At program point L144(lines 137 587) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse3 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 (not (<= 8576 ssl3_accept_~s__state~0))) (and (< ssl3_accept_~s__state~0 8576) .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3))) [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L140(lines 140 586) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L253(lines 253 256) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L598(lines 598 603) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L283(lines 283 285) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L143(lines 143 585) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L600(lines 600 602) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L598-2(lines 597 611) no Hoare annotation was computed. [2022-04-06 13:39:16,102 INFO L882 garLoopResultBuilder]: For program point L283-2(lines 219 558) no Hoare annotation was computed. [2022-04-06 13:39:16,103 INFO L882 garLoopResultBuilder]: For program point L146(lines 146 584) no Hoare annotation was computed. [2022-04-06 13:39:16,103 INFO L882 garLoopResultBuilder]: For program point L605(lines 605 609) no Hoare annotation was computed. [2022-04-06 13:39:16,103 INFO L878 garLoopResultBuilder]: At program point L150(lines 146 584) the Hoare annotation is: (let ((.cse1 (not (<= 8576 ssl3_accept_~s__state~0))) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (= ssl3_accept_~blastFlag~0 1)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and (< ssl3_accept_~s__state~0 8576) .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse5 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-06 13:39:16,103 INFO L882 garLoopResultBuilder]: For program point L149(lines 149 583) no Hoare annotation was computed. [2022-04-06 13:39:16,103 INFO L882 garLoopResultBuilder]: For program point L296(lines 296 298) no Hoare annotation was computed. [2022-04-06 13:39:16,103 INFO L882 garLoopResultBuilder]: For program point L152(lines 152 582) no Hoare annotation was computed. [2022-04-06 13:39:16,103 INFO L882 garLoopResultBuilder]: For program point L296-2(lines 219 558) no Hoare annotation was computed. [2022-04-06 13:39:16,103 INFO L878 garLoopResultBuilder]: At program point L156(lines 152 582) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (not (<= 8576 ssl3_accept_~s__state~0))) (.cse4 (= 2 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse3) (and .cse1 .cse4))) [2022-04-06 13:39:16,104 INFO L882 garLoopResultBuilder]: For program point L155(lines 155 581) no Hoare annotation was computed. [2022-04-06 13:39:16,104 INFO L882 garLoopResultBuilder]: For program point L302(lines 302 306) no Hoare annotation was computed. [2022-04-06 13:39:16,104 INFO L882 garLoopResultBuilder]: For program point L313(lines 313 320) no Hoare annotation was computed. [2022-04-06 13:39:16,104 INFO L882 garLoopResultBuilder]: For program point L158(lines 158 580) no Hoare annotation was computed. [2022-04-06 13:39:16,104 INFO L882 garLoopResultBuilder]: For program point L302-2(lines 302 306) no Hoare annotation was computed. [2022-04-06 13:39:16,104 INFO L882 garLoopResultBuilder]: For program point L313-2(lines 313 320) no Hoare annotation was computed. [2022-04-06 13:39:16,104 INFO L882 garLoopResultBuilder]: For program point L317(lines 317 319) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L878 garLoopResultBuilder]: At program point L162(lines 158 580) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (not (<= 8576 ssl3_accept_~s__state~0))) (.cse4 (= 2 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse3) (and .cse1 .cse4))) [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L161(lines 161 579) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L164(lines 164 578) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L330-2(lines 219 558) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L878 garLoopResultBuilder]: At program point L168(lines 164 578) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (not (<= 8576 ssl3_accept_~s__state~0))) (.cse4 (= 2 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse3) (and .cse1 .cse4))) [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L167(lines 167 577) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L878 garLoopResultBuilder]: At program point L361(lines 336 379) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (not (<= 8576 ssl3_accept_~s__state~0))) (.cse4 (= 2 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse3) (and .cse1 .cse4))) [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L339(lines 339 378) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L386(lines 386 418) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L170(lines 170 576) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L363(lines 363 365) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L342(lines 342 377) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L387(lines 387 393) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L878 garLoopResultBuilder]: At program point L395(lines 386 418) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (not (<= 8576 ssl3_accept_~s__state~0))) (.cse4 (= 2 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse3) (and .cse1 .cse4))) [2022-04-06 13:39:16,105 INFO L878 garLoopResultBuilder]: At program point L174(lines 170 576) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (not (<= 8576 ssl3_accept_~s__state~0))) (.cse4 (= 2 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse3) (and .cse1 .cse4))) [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L173(lines 173 575) no Hoare annotation was computed. [2022-04-06 13:39:16,105 INFO L882 garLoopResultBuilder]: For program point L342-1(lines 342 377) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L343(lines 343 374) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L398(lines 398 416) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L428(lines 428 430) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L176(lines 176 574) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L348(lines 348 372) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L878 garLoopResultBuilder]: At program point L407(lines 398 416) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (not (<= 8576 ssl3_accept_~s__state~0))) (.cse4 (= 2 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse3) (and .cse1 .cse4))) [2022-04-06 13:39:16,106 INFO L878 garLoopResultBuilder]: At program point L177(lines 176 574) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_accept_~blastFlag~0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse2 .cse3) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3))) [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L179(lines 179 573) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L410(lines 410 412) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L437(lines 437 445) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L878 garLoopResultBuilder]: At program point L183(lines 179 573) the Hoare annotation is: (let ((.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 (not (<= 8656 ssl3_accept_~s__state~0))) (and .cse1 .cse2 (= 3 ssl3_accept_~blastFlag~0)) (and .cse3 .cse1 .cse2) (and .cse3 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (< ssl3_accept_~s__state~0 8656)) (and .cse0 .cse1 .cse2))) [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L182(lines 182 572) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L352-2(lines 352 356) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L437-2(lines 437 445) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L185(lines 185 571) no Hoare annotation was computed. [2022-04-06 13:39:16,106 INFO L882 garLoopResultBuilder]: For program point L360(lines 360 368) no Hoare annotation was computed. [2022-04-06 13:39:16,107 INFO L882 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-04-06 13:39:16,107 INFO L878 garLoopResultBuilder]: At program point L189(lines 185 571) the Hoare annotation is: (let ((.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 (not (<= 8656 ssl3_accept_~s__state~0))) (and .cse1 .cse2 (= 3 ssl3_accept_~blastFlag~0)) (and .cse3 .cse1 .cse2) (and .cse3 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (< ssl3_accept_~s__state~0 8656)) (and .cse0 .cse1 .cse2))) [2022-04-06 13:39:16,107 INFO L882 garLoopResultBuilder]: For program point L188(lines 188 570) no Hoare annotation was computed. [2022-04-06 13:39:16,107 INFO L882 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-04-06 13:39:16,107 INFO L882 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-04-06 13:39:16,107 INFO L882 garLoopResultBuilder]: For program point L191(lines 191 569) no Hoare annotation was computed. [2022-04-06 13:39:16,107 INFO L878 garLoopResultBuilder]: At program point L195(lines 191 569) the Hoare annotation is: (let ((.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 (not (<= 8656 ssl3_accept_~s__state~0))) (and .cse1 .cse2 (= 3 ssl3_accept_~blastFlag~0)) (and .cse3 .cse1 .cse2) (and .cse3 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (< ssl3_accept_~s__state~0 8656)) (and .cse0 .cse1 .cse2))) [2022-04-06 13:39:16,107 INFO L882 garLoopResultBuilder]: For program point L194(lines 194 568) no Hoare annotation was computed. [2022-04-06 13:39:16,107 INFO L882 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-04-06 13:39:16,107 INFO L882 garLoopResultBuilder]: For program point L197(lines 197 567) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L878 garLoopResultBuilder]: At program point L201(lines 197 567) the Hoare annotation is: (or (and (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (and (= ssl3_accept_~blastFlag~0 0) (not (<= 8656 ssl3_accept_~s__state~0))) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (< ssl3_accept_~s__state~0 8656))) [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L200(lines 200 566) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L203(lines 203 565) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L486-2(lines 219 558) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L878 garLoopResultBuilder]: At program point L207(lines 203 565) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse1 .cse0 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse1 .cse0) (and .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L206(lines 206 564) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L492(lines 492 496) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L503(lines 503 506) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L209(lines 209 563) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L492-2(lines 492 496) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L508(lines 508 510) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L878 garLoopResultBuilder]: At program point L213(lines 209 563) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= 8672 ssl3_accept_~s__state~0)) (.cse2 (= 3 ssl3_accept_~blastFlag~0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) .cse1 .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2) (and .cse1 .cse0 .cse2))) [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L212(lines 212 562) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L508-2(lines 219 558) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L525(lines 525 531) no Hoare annotation was computed. [2022-04-06 13:39:16,108 INFO L882 garLoopResultBuilder]: For program point L215(lines 215 561) no Hoare annotation was computed. [2022-04-06 13:39:16,109 INFO L882 garLoopResultBuilder]: For program point L517(lines 517 520) no Hoare annotation was computed. [2022-04-06 13:39:16,109 INFO L882 garLoopResultBuilder]: For program point L528-1(lines 219 558) no Hoare annotation was computed. [2022-04-06 13:39:16,109 INFO L882 garLoopResultBuilder]: For program point L528(lines 528 530) no Hoare annotation was computed. [2022-04-06 13:39:16,109 INFO L885 garLoopResultBuilder]: At program point L216(lines 215 561) the Hoare annotation is: true [2022-04-06 13:39:16,109 INFO L885 garLoopResultBuilder]: At program point L218(lines 217 561) the Hoare annotation is: true [2022-04-06 13:39:16,109 INFO L882 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-04-06 13:39:16,109 INFO L878 garLoopResultBuilder]: At program point L529(line 529) the Hoare annotation is: false [2022-04-06 13:39:16,109 INFO L882 garLoopResultBuilder]: For program point L546(lines 546 552) no Hoare annotation was computed. [2022-04-06 13:39:16,109 INFO L882 garLoopResultBuilder]: For program point L536-2(lines 536 540) no Hoare annotation was computed. [2022-04-06 13:39:16,109 INFO L882 garLoopResultBuilder]: For program point L549(lines 549 551) no Hoare annotation was computed. [2022-04-06 13:39:16,109 INFO L882 garLoopResultBuilder]: For program point L546-1(lines 546 552) no Hoare annotation was computed. [2022-04-06 13:39:16,113 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 13:39:16,115 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 13:39:16,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 01:39:16 BasicIcfg [2022-04-06 13:39:16,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 13:39:16,143 INFO L158 Benchmark]: Toolchain (without parser) took 16411.07ms. Allocated memory was 184.5MB in the beginning and 401.6MB in the end (delta: 217.1MB). Free memory was 125.6MB in the beginning and 339.9MB in the end (delta: -214.3MB). Peak memory consumption was 219.2MB. Max. memory is 8.0GB. [2022-04-06 13:39:16,143 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 13:39:16,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.79ms. Allocated memory was 184.5MB in the beginning and 272.6MB in the end (delta: 88.1MB). Free memory was 125.4MB in the beginning and 238.5MB in the end (delta: -113.1MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2022-04-06 13:39:16,144 INFO L158 Benchmark]: Boogie Preprocessor took 35.22ms. Allocated memory is still 272.6MB. Free memory was 238.5MB in the beginning and 236.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 13:39:16,144 INFO L158 Benchmark]: RCFGBuilder took 466.32ms. Allocated memory is still 272.6MB. Free memory was 236.1MB in the beginning and 208.5MB in the end (delta: 27.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-04-06 13:39:16,144 INFO L158 Benchmark]: IcfgTransformer took 44.81ms. Allocated memory is still 272.6MB. Free memory was 208.1MB in the beginning and 205.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-06 13:39:16,144 INFO L158 Benchmark]: TraceAbstraction took 15578.24ms. Allocated memory was 272.6MB in the beginning and 401.6MB in the end (delta: 129.0MB). Free memory was 204.3MB in the beginning and 339.9MB in the end (delta: -135.7MB). Peak memory consumption was 209.8MB. Max. memory is 8.0GB. [2022-04-06 13:39:16,145 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.79ms. Allocated memory was 184.5MB in the beginning and 272.6MB in the end (delta: 88.1MB). Free memory was 125.4MB in the beginning and 238.5MB in the end (delta: -113.1MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.22ms. Allocated memory is still 272.6MB. Free memory was 238.5MB in the beginning and 236.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 466.32ms. Allocated memory is still 272.6MB. Free memory was 236.1MB in the beginning and 208.5MB in the end (delta: 27.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * IcfgTransformer took 44.81ms. Allocated memory is still 272.6MB. Free memory was 208.1MB in the beginning and 205.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 15578.24ms. Allocated memory was 272.6MB in the beginning and 401.6MB in the end (delta: 129.0MB). Free memory was 204.3MB in the beginning and 339.9MB in the end (delta: -135.7MB). Peak memory consumption was 209.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: 630]: 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 5 procedures, 155 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 21, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5781 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5779 mSDsluCounter, 5875 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 529 mSDsCounter, 527 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5784 IncrementalHoareTripleChecker+Invalid, 6311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 527 mSolverCounterUnsat, 5346 mSDtfsCounter, 5784 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3611 GetRequests, 3531 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2726occurred in iteration=16, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 1119 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 53 PreInvPairs, 342 NumberOfFragments, 1120 HoareAnnotationTreeSize, 53 FomulaSimplifications, 3064 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 33 FomulaSimplificationsInter, 6816 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 8257 NumberOfCodeBlocks, 8257 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 9539 ConstructedInterpolants, 0 QuantifiedInterpolants, 13341 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3597 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 19 PerfectInterpolantSequences, 52197/52405 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: 398]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8576 <= s__state)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672)) || (!(8576 <= s__state) && 2 == blastFlag) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8656 <= s__state)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state < 8656)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8576 <= s__state)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672)) || (!(8576 <= s__state) && 2 == blastFlag) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((8448 == s__state && 2 == blastFlag) && !(s__hit == 0)) || ((8448 == s__state && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((8448 == s__state && !(s__hit == 0)) && 3 == blastFlag)) || (blastFlag == 0 && 8448 == s__state)) || ((8448 == s__state && 3 == s__s3__tmp__next_state___0) && 3 == blastFlag) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8576 <= s__state)) || ((s__state < 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8656 <= s__state)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state < 8656)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((blastFlag == 0 && !(8576 <= s__state)) || ((s__state < 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || (blastFlag == 1 && !(8576 <= s__state))) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 1 && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((!(s__hit == 0) && s__state <= 8672) || (blastFlag == 0 && !(8656 <= s__state))) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state < 8656) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((blastFlag == 0 && 8672 <= s__state) || ((2 == blastFlag && !(s__hit == 0)) && 8672 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && 8672 <= s__state) && 3 == blastFlag)) || ((!(s__hit == 0) && 8672 <= s__state) && 3 == blastFlag) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: s__state <= 8672 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((blastFlag == 0 && s__state <= 8672) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8576 <= s__state)) || ((s__state < 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8576 <= s__state)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672)) || (!(8576 <= s__state) && 2 == blastFlag) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8576 <= s__state)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672)) || (!(8576 <= s__state) && 2 == blastFlag) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && 8672 <= s__state) || ((2 == blastFlag && !(s__hit == 0)) && 8672 <= s__state)) || ((!(s__hit == 0) && 8672 <= s__state) && 3 == blastFlag) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8576 <= s__state)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672)) || (!(8576 <= s__state) && 2 == blastFlag) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8576 <= s__state)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672)) || (!(8576 <= s__state) && 2 == blastFlag) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((blastFlag == 0 || ((s__state < 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || (!(s__hit == 0) && 3 == blastFlag)) || (2 == blastFlag && !(s__hit == 0)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8656 <= s__state)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state < 8656)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((blastFlag == 0 || (2 == blastFlag && s__state == 8512)) || (blastFlag == 1 && 8496 == s__state)) || (2 == blastFlag && s__state == 8528)) || (2 == blastFlag && 8560 == s__state)) || (!(s__hit == 0) && 3 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && 8672 <= s__state) && 3 == blastFlag)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state < 8656)) || ((s__state == 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((8448 == s__state && 3 == s__s3__tmp__next_state___0) && 3 == blastFlag)) || s__state == 3) || (2 == blastFlag && !(s__hit == 0))) || (s__state == 8544 && 2 == blastFlag) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((blastFlag == 0 || (2 == blastFlag && s__state == 8512)) || (blastFlag == 1 && 8496 == s__state)) || (2 == blastFlag && s__state == 8528)) || (2 == blastFlag && 8560 == s__state)) || (!(s__hit == 0) && 3 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && 8672 <= s__state) && 3 == blastFlag)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state < 8656)) || ((s__state == 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((8448 == s__state && 3 == s__s3__tmp__next_state___0) && 3 == blastFlag)) || s__state == 3) || (2 == blastFlag && !(s__hit == 0))) || (s__state == 8544 && 2 == blastFlag) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && !(8576 <= s__state)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672)) || (!(8576 <= s__state) && 2 == blastFlag) RESULT: Ultimate proved your program to be correct! [2022-04-06 13:39:16,191 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...