/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 04:09:59,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 04:09:59,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 04:09:59,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 04:09:59,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 04:09:59,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 04:09:59,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 04:09:59,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 04:09:59,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 04:09:59,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 04:09:59,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 04:09:59,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 04:09:59,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 04:09:59,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 04:09:59,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 04:09:59,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 04:09:59,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 04:09:59,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 04:09:59,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 04:09:59,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 04:09:59,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 04:09:59,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 04:09:59,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 04:09:59,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 04:09:59,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 04:09:59,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 04:09:59,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 04:09:59,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 04:09:59,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 04:09:59,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 04:09:59,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 04:09:59,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 04:09:59,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 04:09:59,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 04:09:59,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 04:09:59,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 04:09:59,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 04:09:59,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 04:09:59,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 04:09:59,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 04:09:59,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 04:09:59,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 04:09:59,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 04:09:59,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 04:09:59,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 04:09:59,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 04:09:59,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 04:09:59,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 04:09:59,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 04:09:59,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 04:09:59,937 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 04:09:59,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 04:09:59,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 04:09:59,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 04:09:59,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 04:09:59,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 04:09:59,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 04:09:59,938 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 04:09:59,938 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 04:09:59,938 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 04:09:59,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 04:09:59,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 04:09:59,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 04:09:59,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 04:09:59,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 04:09:59,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:09:59,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 04:09:59,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 04:09:59,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 04:09:59,941 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 04:09:59,941 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 04:09:59,941 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 04:09:59,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 04:09:59,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 04:09:59,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 04:09:59,942 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 04:10:00,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 04:10:00,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 04:10:00,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 04:10:00,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 04:10:00,138 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 04:10:00,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-01-10 04:10:00,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053ee28cd/afd2dc05bb5a4694be59bdef2eb322b2/FLAG599890c00 [2022-01-10 04:10:00,512 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 04:10:00,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-01-10 04:10:00,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053ee28cd/afd2dc05bb5a4694be59bdef2eb322b2/FLAG599890c00 [2022-01-10 04:10:00,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053ee28cd/afd2dc05bb5a4694be59bdef2eb322b2 [2022-01-10 04:10:00,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 04:10:00,941 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 04:10:00,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 04:10:00,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 04:10:00,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 04:10:00,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:10:00" (1/1) ... [2022-01-10 04:10:00,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ea545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:00, skipping insertion in model container [2022-01-10 04:10:00,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:10:00" (1/1) ... [2022-01-10 04:10:00,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 04:10:01,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 04:10:01,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-01-10 04:10:01,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:10:01,257 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 04:10:01,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-01-10 04:10:01,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:10:01,362 INFO L208 MainTranslator]: Completed translation [2022-01-10 04:10:01,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01 WrapperNode [2022-01-10 04:10:01,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 04:10:01,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 04:10:01,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 04:10:01,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 04:10:01,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (1/1) ... [2022-01-10 04:10:01,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (1/1) ... [2022-01-10 04:10:01,425 INFO L137 Inliner]: procedures = 29, calls = 43, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 606 [2022-01-10 04:10:01,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 04:10:01,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 04:10:01,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 04:10:01,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 04:10:01,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (1/1) ... [2022-01-10 04:10:01,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (1/1) ... [2022-01-10 04:10:01,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (1/1) ... [2022-01-10 04:10:01,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (1/1) ... [2022-01-10 04:10:01,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (1/1) ... [2022-01-10 04:10:01,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (1/1) ... [2022-01-10 04:10:01,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (1/1) ... [2022-01-10 04:10:01,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 04:10:01,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 04:10:01,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 04:10:01,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 04:10:01,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (1/1) ... [2022-01-10 04:10:01,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:10:01,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 04:10:01,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 04:10:01,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 04:10:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 04:10:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-01-10 04:10:01,530 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-01-10 04:10:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 04:10:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-10 04:10:01,530 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-10 04:10:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-01-10 04:10:01,530 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-01-10 04:10:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-10 04:10:01,531 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-10 04:10:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-10 04:10:01,531 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-10 04:10:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-10 04:10:01,531 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-10 04:10:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 04:10:01,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 04:10:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-01-10 04:10:01,531 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-01-10 04:10:01,673 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 04:10:01,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 04:10:01,764 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:10:01,767 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:10:01,769 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:10:01,772 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:10:01,774 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:10:02,067 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-01-10 04:10:02,067 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-01-10 04:10:02,067 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-01-10 04:10:02,067 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-01-10 04:10:02,067 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-01-10 04:10:02,068 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-01-10 04:10:02,068 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-01-10 04:10:02,068 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-01-10 04:10:02,068 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-01-10 04:10:02,068 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-01-10 04:10:02,076 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 04:10:02,093 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-10 04:10:02,093 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-10 04:10:02,099 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 04:10:02,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 04:10:02,105 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 04:10:02,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:10:02 BoogieIcfgContainer [2022-01-10 04:10:02,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 04:10:02,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 04:10:02,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 04:10:02,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 04:10:02,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:10:00" (1/3) ... [2022-01-10 04:10:02,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e1351a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:10:02, skipping insertion in model container [2022-01-10 04:10:02,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:01" (2/3) ... [2022-01-10 04:10:02,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e1351a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:10:02, skipping insertion in model container [2022-01-10 04:10:02,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:10:02" (3/3) ... [2022-01-10 04:10:02,114 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-01-10 04:10:02,118 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 04:10:02,118 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 04:10:02,154 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 04:10:02,158 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 04:10:02,158 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 04:10:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 188 states have internal predecessors, (273), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-01-10 04:10:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 04:10:02,175 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:02,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:02,176 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:02,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash -809123790, now seen corresponding path program 1 times [2022-01-10 04:10:02,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:02,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148361137] [2022-01-10 04:10:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:02,188 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:02,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:02,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:02,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 04:10:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:02,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:02,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:02,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:02,390 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:02,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148361137] [2022-01-10 04:10:02,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148361137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:02,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:02,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:02,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675685765] [2022-01-10 04:10:02,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:02,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:02,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:02,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:02,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:02,430 INFO L87 Difference]: Start difference. First operand has 208 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 188 states have internal predecessors, (273), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:02,546 INFO L93 Difference]: Finished difference Result 338 states and 529 transitions. [2022-01-10 04:10:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:02,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 04:10:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:02,555 INFO L225 Difference]: With dead ends: 338 [2022-01-10 04:10:02,556 INFO L226 Difference]: Without dead ends: 198 [2022-01-10 04:10:02,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:02,561 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 178 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:02,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 415 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-01-10 04:10:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-01-10 04:10:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 178 states have internal predecessors, (249), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 04:10:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2022-01-10 04:10:02,624 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 13 [2022-01-10 04:10:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:02,624 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2022-01-10 04:10:02,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2022-01-10 04:10:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 04:10:02,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:02,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:02,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:02,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:02,834 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:02,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash 900719787, now seen corresponding path program 1 times [2022-01-10 04:10:02,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:02,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562236479] [2022-01-10 04:10:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:02,838 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:02,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:02,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:02,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 04:10:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:02,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 04:10:02,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:03,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:03,052 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562236479] [2022-01-10 04:10:03,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562236479] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:03,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:03,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 04:10:03,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800317726] [2022-01-10 04:10:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:03,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 04:10:03,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:03,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 04:10:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 04:10:03,058 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:03,241 INFO L93 Difference]: Finished difference Result 314 states and 449 transitions. [2022-01-10 04:10:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 04:10:03,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 04:10:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:03,244 INFO L225 Difference]: With dead ends: 314 [2022-01-10 04:10:03,244 INFO L226 Difference]: Without dead ends: 262 [2022-01-10 04:10:03,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 04:10:03,245 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 352 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:03,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 386 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-01-10 04:10:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 249. [2022-01-10 04:10:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 213 states have (on average 1.431924882629108) internal successors, (305), 215 states have internal predecessors, (305), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2022-01-10 04:10:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 357 transitions. [2022-01-10 04:10:03,259 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 357 transitions. Word has length 19 [2022-01-10 04:10:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:03,259 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 357 transitions. [2022-01-10 04:10:03,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 357 transitions. [2022-01-10 04:10:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 04:10:03,260 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:03,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:03,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:03,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:03,467 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043530, now seen corresponding path program 1 times [2022-01-10 04:10:03,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:03,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408781639] [2022-01-10 04:10:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:03,468 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:03,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:03,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:03,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 04:10:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:03,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:03,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:03,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:03,583 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:03,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408781639] [2022-01-10 04:10:03,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408781639] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:03,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:03,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:03,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625056093] [2022-01-10 04:10:03,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:03,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:03,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:03,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:03,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:03,585 INFO L87 Difference]: Start difference. First operand 249 states and 357 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:03,604 INFO L93 Difference]: Finished difference Result 402 states and 557 transitions. [2022-01-10 04:10:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:03,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 04:10:03,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:03,606 INFO L225 Difference]: With dead ends: 402 [2022-01-10 04:10:03,606 INFO L226 Difference]: Without dead ends: 306 [2022-01-10 04:10:03,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:03,608 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 238 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:03,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 352 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-01-10 04:10:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 287. [2022-01-10 04:10:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 253 states have (on average 1.4189723320158103) internal successors, (359), 253 states have internal predecessors, (359), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-01-10 04:10:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 406 transitions. [2022-01-10 04:10:03,621 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 406 transitions. Word has length 18 [2022-01-10 04:10:03,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:03,621 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 406 transitions. [2022-01-10 04:10:03,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:03,621 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 406 transitions. [2022-01-10 04:10:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 04:10:03,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:03,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:03,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:03,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:03,829 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:03,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:03,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2086831099, now seen corresponding path program 1 times [2022-01-10 04:10:03,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:03,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419627091] [2022-01-10 04:10:03,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:03,830 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:03,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:03,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:03,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 04:10:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:03,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 04:10:03,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:04,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:04,059 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:04,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419627091] [2022-01-10 04:10:04,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419627091] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:04,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:04,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 04:10:04,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338839441] [2022-01-10 04:10:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:04,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 04:10:04,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:04,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 04:10:04,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 04:10:04,062 INFO L87 Difference]: Start difference. First operand 287 states and 406 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:04,172 INFO L93 Difference]: Finished difference Result 290 states and 408 transitions. [2022-01-10 04:10:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 04:10:04,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 04:10:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:04,174 INFO L225 Difference]: With dead ends: 290 [2022-01-10 04:10:04,175 INFO L226 Difference]: Without dead ends: 286 [2022-01-10 04:10:04,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 04:10:04,176 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 253 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:04,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 437 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-01-10 04:10:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-01-10 04:10:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 253 states have (on average 1.4110671936758894) internal successors, (357), 252 states have internal predecessors, (357), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-01-10 04:10:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 403 transitions. [2022-01-10 04:10:04,189 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 403 transitions. Word has length 29 [2022-01-10 04:10:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:04,189 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 403 transitions. [2022-01-10 04:10:04,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 403 transitions. [2022-01-10 04:10:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 04:10:04,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:04,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:04,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:04,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:04,398 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash -507734156, now seen corresponding path program 1 times [2022-01-10 04:10:04,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:04,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812580380] [2022-01-10 04:10:04,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:04,400 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:04,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:04,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:04,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 04:10:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:04,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 04:10:04,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:04,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:04,651 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:04,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812580380] [2022-01-10 04:10:04,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812580380] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:04,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:04,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 04:10:04,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842849150] [2022-01-10 04:10:04,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:04,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 04:10:04,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 04:10:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 04:10:04,653 INFO L87 Difference]: Start difference. First operand 286 states and 403 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:10:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:04,887 INFO L93 Difference]: Finished difference Result 308 states and 427 transitions. [2022-01-10 04:10:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 04:10:04,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-01-10 04:10:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:04,891 INFO L225 Difference]: With dead ends: 308 [2022-01-10 04:10:04,891 INFO L226 Difference]: Without dead ends: 303 [2022-01-10 04:10:04,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 04:10:04,893 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 281 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:04,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 645 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 04:10:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-01-10 04:10:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2022-01-10 04:10:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 263 states have (on average 1.403041825095057) internal successors, (369), 261 states have internal predecessors, (369), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-01-10 04:10:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 415 transitions. [2022-01-10 04:10:04,912 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 415 transitions. Word has length 33 [2022-01-10 04:10:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:04,913 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 415 transitions. [2022-01-10 04:10:04,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:10:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 415 transitions. [2022-01-10 04:10:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 04:10:04,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:04,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:04,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:05,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:05,125 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:05,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1061247362, now seen corresponding path program 1 times [2022-01-10 04:10:05,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:05,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550337747] [2022-01-10 04:10:05,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:05,126 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:05,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:05,129 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:05,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 04:10:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:05,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 04:10:05,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:05,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:05,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:05,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550337747] [2022-01-10 04:10:05,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550337747] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:05,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:05,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 04:10:05,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487657855] [2022-01-10 04:10:05,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:05,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 04:10:05,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:05,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 04:10:05,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 04:10:05,378 INFO L87 Difference]: Start difference. First operand 296 states and 415 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:10:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:05,547 INFO L93 Difference]: Finished difference Result 308 states and 426 transitions. [2022-01-10 04:10:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 04:10:05,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-01-10 04:10:05,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:05,549 INFO L225 Difference]: With dead ends: 308 [2022-01-10 04:10:05,549 INFO L226 Difference]: Without dead ends: 303 [2022-01-10 04:10:05,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 04:10:05,550 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 265 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:05,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 646 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-01-10 04:10:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2022-01-10 04:10:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 264 states have (on average 1.4015151515151516) internal successors, (370), 262 states have internal predecessors, (370), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-01-10 04:10:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2022-01-10 04:10:05,572 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 34 [2022-01-10 04:10:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:05,572 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2022-01-10 04:10:05,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:10:05,573 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2022-01-10 04:10:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 04:10:05,574 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:05,574 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:05,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:05,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:05,775 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:05,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:05,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1403318816, now seen corresponding path program 1 times [2022-01-10 04:10:05,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:05,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151513720] [2022-01-10 04:10:05,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:05,777 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:05,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:05,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:05,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 04:10:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:05,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:05,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:05,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:05,917 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:05,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151513720] [2022-01-10 04:10:05,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151513720] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:05,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:05,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:05,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513715953] [2022-01-10 04:10:05,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:05,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:05,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:05,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:05,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:05,919 INFO L87 Difference]: Start difference. First operand 297 states and 416 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:10:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:05,961 INFO L93 Difference]: Finished difference Result 336 states and 455 transitions. [2022-01-10 04:10:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:05,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-01-10 04:10:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:05,963 INFO L225 Difference]: With dead ends: 336 [2022-01-10 04:10:05,963 INFO L226 Difference]: Without dead ends: 278 [2022-01-10 04:10:05,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:05,964 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 80 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:05,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 516 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-01-10 04:10:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 264. [2022-01-10 04:10:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 233 states have (on average 1.390557939914163) internal successors, (324), 231 states have internal predecessors, (324), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-01-10 04:10:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 365 transitions. [2022-01-10 04:10:05,979 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 365 transitions. Word has length 34 [2022-01-10 04:10:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:05,979 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 365 transitions. [2022-01-10 04:10:05,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:10:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 365 transitions. [2022-01-10 04:10:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 04:10:05,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:05,980 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:05,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:06,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:06,188 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817110, now seen corresponding path program 1 times [2022-01-10 04:10:06,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:06,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470192420] [2022-01-10 04:10:06,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:06,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:06,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:06,190 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:06,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 04:10:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:06,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 04:10:06,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:06,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:06,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:06,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470192420] [2022-01-10 04:10:06,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470192420] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:06,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:06,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 04:10:06,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781024141] [2022-01-10 04:10:06,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:06,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 04:10:06,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:06,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 04:10:06,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 04:10:06,378 INFO L87 Difference]: Start difference. First operand 264 states and 365 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:06,508 INFO L93 Difference]: Finished difference Result 299 states and 408 transitions. [2022-01-10 04:10:06,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 04:10:06,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-10 04:10:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:06,510 INFO L225 Difference]: With dead ends: 299 [2022-01-10 04:10:06,510 INFO L226 Difference]: Without dead ends: 264 [2022-01-10 04:10:06,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-01-10 04:10:06,511 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 281 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:06,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 415 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-01-10 04:10:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2022-01-10 04:10:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 233 states have (on average 1.3819742489270386) internal successors, (322), 231 states have internal predecessors, (322), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-01-10 04:10:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 363 transitions. [2022-01-10 04:10:06,525 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 363 transitions. Word has length 34 [2022-01-10 04:10:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:06,525 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 363 transitions. [2022-01-10 04:10:06,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 363 transitions. [2022-01-10 04:10:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 04:10:06,526 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:06,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:06,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:06,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:06,735 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:06,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:06,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1671852310, now seen corresponding path program 1 times [2022-01-10 04:10:06,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:06,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068776628] [2022-01-10 04:10:06,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:06,735 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:06,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:06,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:06,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 04:10:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:06,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:06,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:06,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:06,893 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:06,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068776628] [2022-01-10 04:10:06,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068776628] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:06,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:06,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:06,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627563675] [2022-01-10 04:10:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:06,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:06,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:06,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:06,894 INFO L87 Difference]: Start difference. First operand 264 states and 363 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:10:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:06,911 INFO L93 Difference]: Finished difference Result 278 states and 380 transitions. [2022-01-10 04:10:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:06,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-01-10 04:10:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:06,912 INFO L225 Difference]: With dead ends: 278 [2022-01-10 04:10:06,912 INFO L226 Difference]: Without dead ends: 82 [2022-01-10 04:10:06,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:06,912 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 229 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:06,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 256 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-10 04:10:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-01-10 04:10:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 72 states have internal predecessors, (87), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 04:10:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-01-10 04:10:06,916 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 35 [2022-01-10 04:10:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:06,916 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-01-10 04:10:06,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 04:10:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-01-10 04:10:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 04:10:06,917 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:06,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:06,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:07,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:07,123 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash 965976384, now seen corresponding path program 1 times [2022-01-10 04:10:07,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:07,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974742914] [2022-01-10 04:10:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:07,124 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:07,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:07,127 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:07,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 04:10:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:07,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:07,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:07,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:07,235 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:07,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974742914] [2022-01-10 04:10:07,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974742914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:07,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:07,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:07,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243980505] [2022-01-10 04:10:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:07,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:07,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:07,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:07,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:07,237 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 04:10:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:07,254 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-01-10 04:10:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:07,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-10 04:10:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:07,255 INFO L225 Difference]: With dead ends: 106 [2022-01-10 04:10:07,255 INFO L226 Difference]: Without dead ends: 80 [2022-01-10 04:10:07,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:07,256 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:07,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-10 04:10:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-01-10 04:10:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 70 states have internal predecessors, (84), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 04:10:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2022-01-10 04:10:07,259 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 39 [2022-01-10 04:10:07,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:07,260 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2022-01-10 04:10:07,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 04:10:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-01-10 04:10:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 04:10:07,260 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:07,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:07,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:07,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:07,467 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:07,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1309646071, now seen corresponding path program 1 times [2022-01-10 04:10:07,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:07,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011972561] [2022-01-10 04:10:07,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:07,468 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:07,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:07,469 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:07,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 04:10:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:07,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 04:10:07,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:07,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:07,605 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:07,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011972561] [2022-01-10 04:10:07,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011972561] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:07,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:07,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 04:10:07,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562728436] [2022-01-10 04:10:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:07,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 04:10:07,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:07,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 04:10:07,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 04:10:07,606 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 04:10:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:07,614 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-01-10 04:10:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 04:10:07,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-01-10 04:10:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:07,615 INFO L225 Difference]: With dead ends: 104 [2022-01-10 04:10:07,615 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 04:10:07,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 04:10:07,615 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:07,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 04:10:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-01-10 04:10:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 63 states have internal predecessors, (74), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 04:10:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-01-10 04:10:07,618 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 41 [2022-01-10 04:10:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:07,619 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-01-10 04:10:07,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 04:10:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-01-10 04:10:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 04:10:07,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:07,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:07,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:07,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:07,826 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:07,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1492997470, now seen corresponding path program 1 times [2022-01-10 04:10:07,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:07,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178433371] [2022-01-10 04:10:07,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:07,827 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:07,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:07,828 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:07,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 04:10:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:07,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 04:10:07,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:08,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:08,100 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:08,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178433371] [2022-01-10 04:10:08,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178433371] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:08,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:08,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 04:10:08,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832477815] [2022-01-10 04:10:08,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:08,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 04:10:08,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:08,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 04:10:08,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 04:10:08,101 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:08,131 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2022-01-10 04:10:08,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 04:10:08,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-01-10 04:10:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:08,132 INFO L225 Difference]: With dead ends: 97 [2022-01-10 04:10:08,132 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 04:10:08,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 04:10:08,133 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 50 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:08,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 105 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 04:10:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-01-10 04:10:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 63 states have internal predecessors, (73), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 04:10:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-01-10 04:10:08,136 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 45 [2022-01-10 04:10:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:08,136 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-01-10 04:10:08,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-01-10 04:10:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 04:10:08,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:08,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:08,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:08,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:08,344 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:08,344 INFO L85 PathProgramCache]: Analyzing trace with hash -609635321, now seen corresponding path program 1 times [2022-01-10 04:10:08,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:08,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188103427] [2022-01-10 04:10:08,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:08,344 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:08,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:08,358 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:08,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 04:10:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:08,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:08,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:08,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:08,518 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:08,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188103427] [2022-01-10 04:10:08,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188103427] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:08,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:08,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:08,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445688000] [2022-01-10 04:10:08,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:08,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:08,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:08,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:08,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:08,520 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:08,529 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2022-01-10 04:10:08,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:08,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2022-01-10 04:10:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:08,530 INFO L225 Difference]: With dead ends: 103 [2022-01-10 04:10:08,530 INFO L226 Difference]: Without dead ends: 79 [2022-01-10 04:10:08,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:08,531 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:08,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 137 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-10 04:10:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-01-10 04:10:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 04:10:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-01-10 04:10:08,551 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 47 [2022-01-10 04:10:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:08,552 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-01-10 04:10:08,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-01-10 04:10:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 04:10:08,552 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:08,552 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:08,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:08,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:08,759 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash 91429257, now seen corresponding path program 1 times [2022-01-10 04:10:08,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:08,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768189847] [2022-01-10 04:10:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:08,760 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:08,761 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:08,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 04:10:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:08,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 04:10:08,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:08,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:08,926 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:08,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768189847] [2022-01-10 04:10:08,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768189847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:08,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:08,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 04:10:08,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313796402] [2022-01-10 04:10:08,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:08,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:10:08,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:08,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:10:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:10:08,928 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:08,959 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-01-10 04:10:08,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 04:10:08,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2022-01-10 04:10:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:08,960 INFO L225 Difference]: With dead ends: 88 [2022-01-10 04:10:08,960 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 04:10:08,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 04:10:08,962 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:08,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 341 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 04:10:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-01-10 04:10:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 04:10:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-01-10 04:10:08,967 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 47 [2022-01-10 04:10:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:08,967 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-01-10 04:10:08,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-01-10 04:10:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 04:10:08,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:08,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:08,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:09,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:09,171 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:09,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1757068828, now seen corresponding path program 1 times [2022-01-10 04:10:09,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:09,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238180097] [2022-01-10 04:10:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:09,172 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:09,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:09,173 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:09,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 04:10:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:09,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:09,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:09,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:09,321 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:09,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238180097] [2022-01-10 04:10:09,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238180097] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:09,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:09,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:09,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617197769] [2022-01-10 04:10:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:09,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:09,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:09,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:09,323 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:09,339 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2022-01-10 04:10:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:09,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-01-10 04:10:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:09,340 INFO L225 Difference]: With dead ends: 102 [2022-01-10 04:10:09,340 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 04:10:09,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:09,342 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:09,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 04:10:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2022-01-10 04:10:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 04:10:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-01-10 04:10:09,345 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 48 [2022-01-10 04:10:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:09,346 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-01-10 04:10:09,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-01-10 04:10:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 04:10:09,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:09,346 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:09,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-01-10 04:10:09,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:09,553 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:09,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:09,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1056004250, now seen corresponding path program 1 times [2022-01-10 04:10:09,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:09,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360852041] [2022-01-10 04:10:09,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:09,553 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:09,561 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:09,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 04:10:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:09,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 04:10:09,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:09,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:09,711 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:09,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360852041] [2022-01-10 04:10:09,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360852041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:09,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:09,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 04:10:09,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901577552] [2022-01-10 04:10:09,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:09,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:10:09,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:09,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:10:09,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:10:09,712 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:09,733 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-01-10 04:10:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 04:10:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-01-10 04:10:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:09,734 INFO L225 Difference]: With dead ends: 87 [2022-01-10 04:10:09,734 INFO L226 Difference]: Without dead ends: 71 [2022-01-10 04:10:09,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 04:10:09,734 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:09,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 332 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-10 04:10:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-01-10 04:10:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 04:10:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-01-10 04:10:09,737 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 48 [2022-01-10 04:10:09,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:09,737 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-01-10 04:10:09,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-01-10 04:10:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 04:10:09,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:09,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:09,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-01-10 04:10:09,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:09,944 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash 246917540, now seen corresponding path program 1 times [2022-01-10 04:10:09,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:09,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311205100] [2022-01-10 04:10:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:09,945 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:09,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:09,946 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:09,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 04:10:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:10,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:10,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:10,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:10,082 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:10,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311205100] [2022-01-10 04:10:10,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311205100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:10,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:10,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:10,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027138770] [2022-01-10 04:10:10,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:10,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:10,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:10,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:10,083 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:10,101 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-01-10 04:10:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:10,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-01-10 04:10:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:10,102 INFO L225 Difference]: With dead ends: 85 [2022-01-10 04:10:10,102 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 04:10:10,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:10,103 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:10,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 97 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 04:10:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2022-01-10 04:10:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 04:10:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-01-10 04:10:10,105 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 48 [2022-01-10 04:10:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:10,105 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-01-10 04:10:10,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-01-10 04:10:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 04:10:10,106 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:10,106 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:10,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:10,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:10,314 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:10,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash 947982118, now seen corresponding path program 1 times [2022-01-10 04:10:10,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:10,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251951529] [2022-01-10 04:10:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:10,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:10,318 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:10,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 04:10:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:10,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:10,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:10,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:10,463 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:10,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251951529] [2022-01-10 04:10:10,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251951529] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:10,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:10,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:10,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148557369] [2022-01-10 04:10:10,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:10,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:10,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:10,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:10,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:10,464 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:10,468 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-01-10 04:10:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:10,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-01-10 04:10:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:10,469 INFO L225 Difference]: With dead ends: 69 [2022-01-10 04:10:10,469 INFO L226 Difference]: Without dead ends: 57 [2022-01-10 04:10:10,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:10,470 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:10,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-10 04:10:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-01-10 04:10:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 04:10:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-01-10 04:10:10,472 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 48 [2022-01-10 04:10:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:10,472 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-01-10 04:10:10,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-01-10 04:10:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 04:10:10,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:10,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:10,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-01-10 04:10:10,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:10,679 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:10,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1173355825, now seen corresponding path program 1 times [2022-01-10 04:10:10,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:10,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214002036] [2022-01-10 04:10:10,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:10,680 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:10,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:10,684 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:10,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 04:10:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:10,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:10,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:10,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:10,856 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:10,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214002036] [2022-01-10 04:10:10,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214002036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:10,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:10,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:10,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167411072] [2022-01-10 04:10:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:10,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:10,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:10,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:10,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:10,857 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 04:10:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:10,875 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-01-10 04:10:10,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:10,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-01-10 04:10:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:10,879 INFO L225 Difference]: With dead ends: 59 [2022-01-10 04:10:10,879 INFO L226 Difference]: Without dead ends: 52 [2022-01-10 04:10:10,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:10,879 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:10,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 74 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-10 04:10:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-01-10 04:10:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 04:10:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-01-10 04:10:10,883 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2022-01-10 04:10:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:10,883 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-01-10 04:10:10,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 04:10:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-01-10 04:10:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-10 04:10:10,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:10,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:10,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:11,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:11,094 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:11,094 INFO L85 PathProgramCache]: Analyzing trace with hash -370766040, now seen corresponding path program 1 times [2022-01-10 04:10:11,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:11,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861346768] [2022-01-10 04:10:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:11,095 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:11,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:11,096 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:10:11,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 04:10:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:11,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 04:10:11,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:11,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:11,301 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:11,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861346768] [2022-01-10 04:10:11,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861346768] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:11,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:11,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 04:10:11,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591654841] [2022-01-10 04:10:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:11,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 04:10:11,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:11,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 04:10:11,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 04:10:11,302 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:11,317 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-01-10 04:10:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 04:10:11,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-01-10 04:10:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:11,318 INFO L225 Difference]: With dead ends: 52 [2022-01-10 04:10:11,318 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 04:10:11,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 04:10:11,320 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:11,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 191 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 04:10:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 04:10:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 04:10:11,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2022-01-10 04:10:11,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:11,325 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 04:10:11,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 04:10:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 04:10:11,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 04:10:11,327 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 04:10:11,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-01-10 04:10:11,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:10:11,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 04:10:13,471 INFO L861 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 618 628) the Hoare annotation is: true [2022-01-10 04:10:13,471 INFO L854 garLoopResultBuilder]: At program point L573(lines 568 575) the Hoare annotation is: (or (not (= (_ bv3 32) ~SKIP1~0)) (not (= ~MPR1~0 (_ bv5 32))) (not (= ~compRegistered~0 (_ bv1 32))) (not (= ~DC~0 (_ bv2 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~NP~0 ~s~0)) (= ~setEventCalled~0 (_ bv1 32)) (not (= (_ bv7 32) ~IPC~0)) (not (= ~pended~0 (_ bv0 32))) (not (= ~NP~0 (_ bv1 32)))) [2022-01-10 04:10:13,471 INFO L858 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 618 628) no Hoare annotation was computed. [2022-01-10 04:10:13,471 INFO L858 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2022-01-10 04:10:13,472 INFO L858 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2022-01-10 04:10:13,472 INFO L858 garLoopResultBuilder]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2022-01-10 04:10:13,472 INFO L854 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (or (not (= (_ bv3 32) ~SKIP1~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~DC~0 (_ bv2 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (not (= (_ bv7 32) ~IPC~0)) (not (= ~pended~0 (_ bv0 32))) (not (= ~NP~0 (_ bv1 32)))) [2022-01-10 04:10:13,481 INFO L854 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (or (not (= (_ bv3 32) ~SKIP1~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~DC~0 (_ bv2 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (not (= (_ bv7 32) ~IPC~0)) (not (= ~pended~0 (_ bv0 32))) (not (= ~NP~0 (_ bv1 32)))) [2022-01-10 04:10:13,481 INFO L858 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2022-01-10 04:10:13,481 INFO L854 garLoopResultBuilder]: At program point KbFilter_CreateCloseENTRY(lines 629 664) the Hoare annotation is: (or (not (= (_ bv3 32) ~SKIP1~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~DC~0 (_ bv2 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (not (= (_ bv7 32) ~IPC~0)) (not (= ~pended~0 (_ bv0 32))) (not (= ~NP~0 (_ bv1 32)))) [2022-01-10 04:10:13,481 INFO L854 garLoopResultBuilder]: At program point L660(line 660) the Hoare annotation is: (or (not (= (_ bv3 32) ~SKIP1~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~DC~0 (_ bv2 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (not (= (_ bv7 32) ~IPC~0)) (not (= ~pended~0 (_ bv0 32))) (not (= ~NP~0 (_ bv1 32)))) [2022-01-10 04:10:13,481 INFO L858 garLoopResultBuilder]: For program point L660-1(line 660) no Hoare annotation was computed. [2022-01-10 04:10:13,481 INFO L858 garLoopResultBuilder]: For program point KbFilter_CreateCloseFINAL(lines 629 664) no Hoare annotation was computed. [2022-01-10 04:10:13,481 INFO L858 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2022-01-10 04:10:13,482 INFO L858 garLoopResultBuilder]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2022-01-10 04:10:13,482 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2022-01-10 04:10:13,482 INFO L854 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~DC~0 (_ bv2 32)))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (= ~NP~0 ~s~0)) (.cse5 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= ~pended~0 (_ bv0 32)))) (.cse7 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv1 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-01-10 04:10:13,482 INFO L858 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2022-01-10 04:10:13,482 INFO L854 garLoopResultBuilder]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~DC~0 (_ bv2 32)))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (= (_ bv7 32) ~IPC~0))) (.cse5 (not (= ~pended~0 (_ bv0 32)))) (.cse6 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 (not (= ~compRegistered~0 (_ bv1 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-01-10 04:10:13,482 INFO L861 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-01-10 04:10:13,482 INFO L858 garLoopResultBuilder]: For program point errorFnFINAL(lines 1009 1016) no Hoare annotation was computed. [2022-01-10 04:10:13,482 INFO L858 garLoopResultBuilder]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2022-01-10 04:10:13,483 INFO L858 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2022-01-10 04:10:13,483 INFO L854 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: false [2022-01-10 04:10:13,483 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2022-01-10 04:10:13,483 INFO L858 garLoopResultBuilder]: For program point L168(lines 168 271) no Hoare annotation was computed. [2022-01-10 04:10:13,483 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 282) no Hoare annotation was computed. [2022-01-10 04:10:13,483 INFO L858 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2022-01-10 04:10:13,483 INFO L858 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2022-01-10 04:10:13,483 INFO L858 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2022-01-10 04:10:13,483 INFO L858 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2022-01-10 04:10:13,483 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 409) no Hoare annotation was computed. [2022-01-10 04:10:13,483 INFO L854 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,484 INFO L854 garLoopResultBuilder]: At program point L369(lines 368 409) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,484 INFO L854 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,484 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 281) no Hoare annotation was computed. [2022-01-10 04:10:13,484 INFO L854 garLoopResultBuilder]: At program point L997(line 997) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,484 INFO L858 garLoopResultBuilder]: For program point L997-1(line 997) no Hoare annotation was computed. [2022-01-10 04:10:13,484 INFO L858 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2022-01-10 04:10:13,484 INFO L858 garLoopResultBuilder]: For program point L700(lines 700 729) no Hoare annotation was computed. [2022-01-10 04:10:13,484 INFO L858 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2022-01-10 04:10:13,484 INFO L854 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: false [2022-01-10 04:10:13,484 INFO L854 garLoopResultBuilder]: At program point L701(lines 700 729) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,484 INFO L858 garLoopResultBuilder]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L603(lines 603 615) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 342) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L339-2(lines 339 342) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 280) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 291) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L769(lines 769 792) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L703(lines 703 728) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L854 garLoopResultBuilder]: At program point L604(lines 603 615) the Hoare annotation is: (and (= ~compRegistered~0 (_ bv1 32)) (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 408) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2022-01-10 04:10:13,485 INFO L854 garLoopResultBuilder]: At program point L109(lines 108 291) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,486 INFO L854 garLoopResultBuilder]: At program point L76(lines 57 78) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,490 INFO L854 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,490 INFO L854 garLoopResultBuilder]: At program point L770(lines 769 792) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= ~s~0 (_ bv3 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,490 INFO L854 garLoopResultBuilder]: At program point L374(lines 373 408) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,490 INFO L858 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2022-01-10 04:10:13,490 INFO L854 garLoopResultBuilder]: At program point L606(lines 605 615) the Hoare annotation is: (and (= ~compRegistered~0 (_ bv1 32)) (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,490 INFO L854 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= ~DC~0 (_ bv2 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,490 INFO L854 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false [2022-01-10 04:10:13,490 INFO L858 garLoopResultBuilder]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2022-01-10 04:10:13,490 INFO L858 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2022-01-10 04:10:13,491 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 279) no Hoare annotation was computed. [2022-01-10 04:10:13,491 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 290) no Hoare annotation was computed. [2022-01-10 04:10:13,491 INFO L854 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,491 INFO L858 garLoopResultBuilder]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2022-01-10 04:10:13,491 INFO L858 garLoopResultBuilder]: For program point L706(lines 706 727) no Hoare annotation was computed. [2022-01-10 04:10:13,491 INFO L854 garLoopResultBuilder]: At program point L376(lines 375 408) the Hoare annotation is: (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) [2022-01-10 04:10:13,491 INFO L854 garLoopResultBuilder]: At program point L112(lines 111 290) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,491 INFO L858 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-01-10 04:10:13,491 INFO L854 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: false [2022-01-10 04:10:13,491 INFO L854 garLoopResultBuilder]: At program point L1005(lines 822 1007) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,491 INFO L854 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,492 INFO L858 garLoopResultBuilder]: For program point L774(lines 774 791) no Hoare annotation was computed. [2022-01-10 04:10:13,492 INFO L854 garLoopResultBuilder]: At program point L576(lines 576 617) the Hoare annotation is: (and (= ~compRegistered~0 (_ bv1 32)) (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,492 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 278) no Hoare annotation was computed. [2022-01-10 04:10:13,492 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 289) no Hoare annotation was computed. [2022-01-10 04:10:13,492 INFO L858 garLoopResultBuilder]: For program point L940(lines 940 943) no Hoare annotation was computed. [2022-01-10 04:10:13,492 INFO L854 garLoopResultBuilder]: At program point L775(lines 774 791) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= ~s~0 (_ bv3 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,492 INFO L854 garLoopResultBuilder]: At program point L742(lines 689 744) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,492 INFO L858 garLoopResultBuilder]: For program point L709(lines 709 726) no Hoare annotation was computed. [2022-01-10 04:10:13,492 INFO L854 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: false [2022-01-10 04:10:13,492 INFO L854 garLoopResultBuilder]: At program point L115(lines 114 289) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,492 INFO L858 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2022-01-10 04:10:13,492 INFO L858 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2022-01-10 04:10:13,493 INFO L858 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-01-10 04:10:13,493 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 349) no Hoare annotation was computed. [2022-01-10 04:10:13,493 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2022-01-10 04:10:13,493 INFO L858 garLoopResultBuilder]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2022-01-10 04:10:13,493 INFO L854 garLoopResultBuilder]: At program point L777(lines 776 791) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= ~s~0 (_ bv3 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,493 INFO L854 garLoopResultBuilder]: At program point L249(line 249) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= ~s~0 (_ bv3 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,493 INFO L858 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2022-01-10 04:10:13,493 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 277) no Hoare annotation was computed. [2022-01-10 04:10:13,493 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 288) no Hoare annotation was computed. [2022-01-10 04:10:13,493 INFO L858 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2022-01-10 04:10:13,493 INFO L858 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-01-10 04:10:13,493 INFO L854 garLoopResultBuilder]: At program point L184(line 184) the Hoare annotation is: false [2022-01-10 04:10:13,493 INFO L858 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2022-01-10 04:10:13,494 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 457) no Hoare annotation was computed. [2022-01-10 04:10:13,494 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 04:10:13,494 INFO L854 garLoopResultBuilder]: At program point L218(line 218) the Hoare annotation is: (and (= ~compRegistered~0 (_ bv1 32)) (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,494 INFO L858 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2022-01-10 04:10:13,494 INFO L858 garLoopResultBuilder]: For program point L450(lines 450 452) no Hoare annotation was computed. [2022-01-10 04:10:13,494 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 276) no Hoare annotation was computed. [2022-01-10 04:10:13,494 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 287) no Hoare annotation was computed. [2022-01-10 04:10:13,494 INFO L854 garLoopResultBuilder]: At program point L54(lines 43 56) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,494 INFO L854 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: false [2022-01-10 04:10:13,494 INFO L858 garLoopResultBuilder]: For program point L814-1(lines 793 818) no Hoare annotation was computed. [2022-01-10 04:10:13,494 INFO L858 garLoopResultBuilder]: For program point L385(line 385) no Hoare annotation was computed. [2022-01-10 04:10:13,495 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 412) no Hoare annotation was computed. [2022-01-10 04:10:13,495 INFO L854 garLoopResultBuilder]: At program point L354(lines 353 412) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,495 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 275) no Hoare annotation was computed. [2022-01-10 04:10:13,495 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 286) no Hoare annotation was computed. [2022-01-10 04:10:13,495 INFO L858 garLoopResultBuilder]: For program point L883(lines 883 988) no Hoare annotation was computed. [2022-01-10 04:10:13,495 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 456) no Hoare annotation was computed. [2022-01-10 04:10:13,495 INFO L854 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= ~DC~0 (_ bv2 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,495 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 04:10:13,495 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2022-01-10 04:10:13,495 INFO L858 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2022-01-10 04:10:13,495 INFO L854 garLoopResultBuilder]: At program point L884(lines 883 988) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,495 INFO L854 garLoopResultBuilder]: At program point L819(lines 745 821) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,495 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-01-10 04:10:13,496 INFO L854 garLoopResultBuilder]: At program point L258(line 258) the Hoare annotation is: false [2022-01-10 04:10:13,497 INFO L858 garLoopResultBuilder]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2022-01-10 04:10:13,497 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 274) no Hoare annotation was computed. [2022-01-10 04:10:13,497 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 285) no Hoare annotation was computed. [2022-01-10 04:10:13,497 INFO L858 garLoopResultBuilder]: For program point L754(lines 754 766) no Hoare annotation was computed. [2022-01-10 04:10:13,497 INFO L858 garLoopResultBuilder]: For program point L754-1(lines 754 766) no Hoare annotation was computed. [2022-01-10 04:10:13,498 INFO L854 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: false [2022-01-10 04:10:13,498 INFO L858 garLoopResultBuilder]: For program point L358(lines 358 411) no Hoare annotation was computed. [2022-01-10 04:10:13,498 INFO L854 garLoopResultBuilder]: At program point L292(lines 81 294) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,498 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 04:10:13,498 INFO L854 garLoopResultBuilder]: At program point L359(lines 358 411) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,498 INFO L854 garLoopResultBuilder]: At program point L227(line 227) the Hoare annotation is: false [2022-01-10 04:10:13,498 INFO L854 garLoopResultBuilder]: At program point L194(lines 194 195) the Hoare annotation is: (and (= ~compRegistered~0 (_ bv1 32)) (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~MPR1~0 (_ bv5 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,498 INFO L858 garLoopResultBuilder]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2022-01-10 04:10:13,498 INFO L858 garLoopResultBuilder]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2022-01-10 04:10:13,498 INFO L854 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= ~s~0 (_ bv3 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,498 INFO L854 garLoopResultBuilder]: At program point L756(line 756) the Hoare annotation is: false [2022-01-10 04:10:13,498 INFO L858 garLoopResultBuilder]: For program point L756-1(line 756) no Hoare annotation was computed. [2022-01-10 04:10:13,498 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 273) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 284) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L854 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,499 INFO L858 garLoopResultBuilder]: For program point L956(lines 956 958) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L858 garLoopResultBuilder]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L858 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L858 garLoopResultBuilder]: For program point L891(lines 891 986) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L858 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L858 garLoopResultBuilder]: For program point L594-1(lines 581 600) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L854 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= ~DC~0 (_ bv2 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,499 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 410) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L858 garLoopResultBuilder]: For program point L330(lines 330 413) no Hoare annotation was computed. [2022-01-10 04:10:13,499 INFO L854 garLoopResultBuilder]: At program point L330-1(lines 324 465) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= ~DC~0 (_ bv2 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,500 INFO L854 garLoopResultBuilder]: At program point L264(lines 264 265) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= ~s~0 (_ bv3 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,500 INFO L858 garLoopResultBuilder]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2022-01-10 04:10:13,500 INFO L858 garLoopResultBuilder]: For program point L165(lines 165 272) no Hoare annotation was computed. [2022-01-10 04:10:13,500 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 283) no Hoare annotation was computed. [2022-01-10 04:10:13,500 INFO L854 garLoopResultBuilder]: At program point L892(lines 891 986) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,500 INFO L858 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2022-01-10 04:10:13,500 INFO L858 garLoopResultBuilder]: For program point L430(lines 414 463) no Hoare annotation was computed. [2022-01-10 04:10:13,500 INFO L854 garLoopResultBuilder]: At program point L364(lines 363 410) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~MPR1~0 (_ bv5 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,500 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-01-10 04:10:13,500 INFO L858 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2022-01-10 04:10:13,500 INFO L858 garLoopResultBuilder]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2022-01-10 04:10:13,500 INFO L854 garLoopResultBuilder]: At program point L596(line 596) the Hoare annotation is: false [2022-01-10 04:10:13,500 INFO L861 garLoopResultBuilder]: At program point L464(lines 295 466) the Hoare annotation is: true [2022-01-10 04:10:13,501 INFO L858 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2022-01-10 04:10:13,501 INFO L854 garLoopResultBuilder]: At program point L233(lines 233 234) the Hoare annotation is: (and (= (_ bv4 32) ~SKIP2~0) (= (_ bv3 32) ~SKIP1~0) (= |ULTIMATE.start_main_~status~1#1| (_ bv0 32)) (= ~DC~0 (_ bv2 32)) (= ~compRegistered~0 (_ bv0 32)) (= ~pended~0 (_ bv0 32)) (= ~NP~0 (_ bv1 32)) (= ~s~0 (_ bv3 32)) (= (_ bv7 32) ~IPC~0)) [2022-01-10 04:10:13,501 INFO L858 garLoopResultBuilder]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2022-01-10 04:10:13,501 INFO L854 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughENTRY(lines 665 688) the Hoare annotation is: (or (not (= (_ bv3 32) ~SKIP1~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~DC~0 (_ bv2 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (not (= (_ bv7 32) ~IPC~0)) (not (= ~pended~0 (_ bv0 32))) (not (= ~NP~0 (_ bv1 32)))) [2022-01-10 04:10:13,501 INFO L854 garLoopResultBuilder]: At program point L684(line 684) the Hoare annotation is: (or (not (= (_ bv3 32) ~SKIP1~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~DC~0 (_ bv2 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~s~0)| ~NP~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= ~pended~0 (_ bv0 32))) (= ~s~0 (_ bv3 32)) (not (= ~NP~0 (_ bv1 32)))) [2022-01-10 04:10:13,501 INFO L858 garLoopResultBuilder]: For program point L684-1(line 684) no Hoare annotation was computed. [2022-01-10 04:10:13,502 INFO L858 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughFINAL(lines 665 688) no Hoare annotation was computed. [2022-01-10 04:10:13,502 INFO L854 garLoopResultBuilder]: At program point L678(line 678) the Hoare annotation is: (or (not (= (_ bv3 32) ~SKIP1~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~DC~0 (_ bv2 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~s~0)| ~NP~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= ~pended~0 (_ bv0 32))) (not (= ~NP~0 (_ bv1 32)))) [2022-01-10 04:10:13,502 INFO L858 garLoopResultBuilder]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2022-01-10 04:10:13,502 INFO L858 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2022-01-10 04:10:13,502 INFO L858 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2022-01-10 04:10:13,502 INFO L854 garLoopResultBuilder]: At program point L510(lines 509 526) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~DC~0 (_ bv2 32)))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= ~pended~0 (_ bv0 32)))) (.cse5 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 .cse2 (not (= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 (= ~s~0 (_ bv3 32)) .cse5) (or .cse0 (not (= ~MPR1~0 (_ bv5 32))) (not (= ~compRegistered~0 (_ bv1 32))) .cse1 (and (= ((_ sign_extend 32) (_ bv3221225494 32)) IofCallDriver_~__cil_tmp7~0) (= ~s~0 ~MPR1~0)) .cse2 (not (= |old(~s~0)| ~NP~0)) .cse3 .cse4 .cse5))) [2022-01-10 04:10:13,502 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2022-01-10 04:10:13,502 INFO L854 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 481 553) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~DC~0 (_ bv2 32)))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= ~pended~0 (_ bv0 32)))) (.cse5 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 .cse2 (not (= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 (= ~s~0 (_ bv3 32)) .cse5) (or .cse0 (not (= ~MPR1~0 (_ bv5 32))) (not (= ~compRegistered~0 (_ bv1 32))) .cse1 .cse2 (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) .cse3 .cse4 .cse5))) [2022-01-10 04:10:13,502 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2022-01-10 04:10:13,503 INFO L854 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~DC~0 (_ bv2 32)))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= ~pended~0 (_ bv0 32)))) (.cse5 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 .cse2 (not (= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 (= ~s~0 (_ bv3 32)) .cse5) (let ((.cse6 (= ((_ sign_extend 32) (_ bv3221225494 32)) IofCallDriver_~__cil_tmp7~0)) (.cse7 (= ~s~0 ~MPR1~0))) (or .cse0 (and .cse6 (= IofCallDriver_~returnVal2~0 (_ bv0 32)) .cse7) (not (= ~MPR1~0 (_ bv5 32))) (and .cse6 (= (bvadd (_ bv1073741823 32) IofCallDriver_~returnVal2~0) (_ bv0 32)) .cse7) (not (= ~compRegistered~0 (_ bv1 32))) .cse1 .cse2 (not (= |old(~s~0)| ~NP~0)) .cse3 (and (= IofCallDriver_~returnVal2~0 (_ bv259 32)) .cse6 (= ~setEventCalled~0 (_ bv1 32)) .cse7) .cse4 .cse5)))) [2022-01-10 04:10:13,503 INFO L854 garLoopResultBuilder]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~DC~0 (_ bv2 32)))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= ~pended~0 (_ bv0 32)))) (.cse5 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 .cse2 (not (= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 .cse5) (or .cse0 (not (= ~MPR1~0 (_ bv5 32))) (not (= ~compRegistered~0 (_ bv1 32))) .cse1 .cse2 (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) .cse3 .cse4 .cse5))) [2022-01-10 04:10:13,503 INFO L858 garLoopResultBuilder]: For program point L491-1(line 491) no Hoare annotation was computed. [2022-01-10 04:10:13,503 INFO L858 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 481 553) no Hoare annotation was computed. [2022-01-10 04:10:13,503 INFO L854 garLoopResultBuilder]: At program point L512(lines 511 526) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~DC~0 (_ bv2 32)))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= ~pended~0 (_ bv0 32)))) (.cse5 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 .cse2 (not (= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 (= ~s~0 (_ bv3 32)) .cse5) (or .cse0 (not (= ~MPR1~0 (_ bv5 32))) (not (= ~compRegistered~0 (_ bv1 32))) .cse1 .cse2 (not (= |old(~s~0)| ~NP~0)) .cse3 (and (= ((_ sign_extend 32) (_ bv3221225494 32)) IofCallDriver_~__cil_tmp7~0) (= ~setEventCalled~0 (_ bv1 32)) (= ~s~0 ~MPR1~0)) .cse4 .cse5))) [2022-01-10 04:10:13,503 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2022-01-10 04:10:13,503 INFO L858 garLoopResultBuilder]: For program point L504(lines 504 527) no Hoare annotation was computed. [2022-01-10 04:10:13,503 INFO L858 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2022-01-10 04:10:13,503 INFO L858 garLoopResultBuilder]: For program point L533(lines 533 539) no Hoare annotation was computed. [2022-01-10 04:10:13,503 INFO L854 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~DC~0 (_ bv2 32)))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= ~pended~0 (_ bv0 32)))) (.cse5 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 .cse2 (not (= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 .cse5) (or .cse0 (not (= ~MPR1~0 (_ bv5 32))) (not (= ~compRegistered~0 (_ bv1 32))) .cse1 .cse2 (not (= |old(~s~0)| ~NP~0)) .cse3 .cse4 .cse5))) [2022-01-10 04:10:13,503 INFO L858 garLoopResultBuilder]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2022-01-10 04:10:13,504 INFO L858 garLoopResultBuilder]: For program point L509(lines 509 526) no Hoare annotation was computed. [2022-01-10 04:10:13,504 INFO L854 garLoopResultBuilder]: At program point L505(lines 504 527) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~DC~0 (_ bv2 32)))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= ~pended~0 (_ bv0 32)))) (.cse5 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 .cse2 (not (= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 (= ~s~0 (_ bv3 32)) .cse5) (or .cse0 (not (= ~MPR1~0 (_ bv5 32))) (not (= ~compRegistered~0 (_ bv1 32))) .cse1 (and (= ((_ sign_extend 32) (_ bv3221225494 32)) IofCallDriver_~__cil_tmp7~0) (= ~s~0 ~MPR1~0)) .cse2 (not (= |old(~s~0)| ~NP~0)) .cse3 .cse4 .cse5))) [2022-01-10 04:10:13,504 INFO L854 garLoopResultBuilder]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= ~DC~0 (_ bv2 32)))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= ~pended~0 (_ bv0 32)))) (.cse5 (not (= ~NP~0 (_ bv1 32))))) (and (or .cse0 (not (= ~compRegistered~0 (_ bv0 32))) .cse1 .cse2 (not (= |old(~s~0)| ~SKIP1~0)) .cse3 .cse4 .cse5) (or .cse0 (not (= ~MPR1~0 (_ bv5 32))) (not (= ~compRegistered~0 (_ bv1 32))) .cse1 .cse2 (not (= |old(~s~0)| ~NP~0)) (and (= ((_ sign_extend 32) (_ bv3221225494 32)) IofCallDriver_~__cil_tmp7~0) (= ~setEventCalled~0 (_ bv1 32)) (= ~NP~0 ~s~0)) .cse3 .cse4 .cse5))) [2022-01-10 04:10:13,504 INFO L858 garLoopResultBuilder]: For program point L489(lines 489 501) no Hoare annotation was computed. [2022-01-10 04:10:13,504 INFO L858 garLoopResultBuilder]: For program point L489-1(lines 489 501) no Hoare annotation was computed. [2022-01-10 04:10:13,504 INFO L854 garLoopResultBuilder]: At program point L475(line 475) the Hoare annotation is: (or (not (= (_ bv3 32) ~SKIP1~0)) (not (= ~MPR1~0 (_ bv5 32))) (not (= ~compRegistered~0 (_ bv1 32))) (not (= ~DC~0 (_ bv2 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~s~0)| ~NP~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= ~pended~0 (_ bv0 32))) (not (= ~setEventCalled~0 (_ bv1 32))) (not (= ~NP~0 (_ bv1 32)))) [2022-01-10 04:10:13,504 INFO L858 garLoopResultBuilder]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2022-01-10 04:10:13,505 INFO L854 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 467 480) the Hoare annotation is: (or (not (= (_ bv3 32) ~SKIP1~0)) (not (= ~MPR1~0 (_ bv5 32))) (not (= ~compRegistered~0 (_ bv1 32))) (not (= ~DC~0 (_ bv2 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (not (= (_ bv7 32) ~IPC~0)) (not (= ~pended~0 (_ bv0 32))) (not (= ~setEventCalled~0 (_ bv1 32))) (not (= ~NP~0 (_ bv1 32)))) [2022-01-10 04:10:13,505 INFO L858 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2022-01-10 04:10:13,508 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:13,510 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 04:10:13,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:10:13 BoogieIcfgContainer [2022-01-10 04:10:13,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 04:10:13,544 INFO L158 Benchmark]: Toolchain (without parser) took 12602.40ms. Allocated memory was 178.3MB in the beginning and 276.8MB in the end (delta: 98.6MB). Free memory was 121.1MB in the beginning and 232.6MB in the end (delta: -111.5MB). Peak memory consumption was 135.1MB. Max. memory is 8.0GB. [2022-01-10 04:10:13,544 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 04:10:13,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.35ms. Allocated memory was 178.3MB in the beginning and 230.7MB in the end (delta: 52.4MB). Free memory was 121.0MB in the beginning and 194.6MB in the end (delta: -73.6MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-01-10 04:10:13,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.06ms. Allocated memory is still 230.7MB. Free memory was 194.6MB in the beginning and 191.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 04:10:13,545 INFO L158 Benchmark]: Boogie Preprocessor took 49.98ms. Allocated memory is still 230.7MB. Free memory was 191.4MB in the beginning and 188.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 04:10:13,545 INFO L158 Benchmark]: RCFGBuilder took 630.52ms. Allocated memory is still 230.7MB. Free memory was 188.3MB in the beginning and 156.3MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-01-10 04:10:13,545 INFO L158 Benchmark]: TraceAbstraction took 11434.07ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 155.8MB in the beginning and 232.6MB in the end (delta: -76.9MB). Peak memory consumption was 118.2MB. Max. memory is 8.0GB. [2022-01-10 04:10:13,547 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.11ms. Allocated memory is still 178.3MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.35ms. Allocated memory was 178.3MB in the beginning and 230.7MB in the end (delta: 52.4MB). Free memory was 121.0MB in the beginning and 194.6MB in the end (delta: -73.6MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.06ms. Allocated memory is still 230.7MB. Free memory was 194.6MB in the beginning and 191.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.98ms. Allocated memory is still 230.7MB. Free memory was 191.4MB in the beginning and 188.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 630.52ms. Allocated memory is still 230.7MB. Free memory was 188.3MB in the beginning and 156.3MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11434.07ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 155.8MB in the beginning and 232.6MB in the end (delta: -76.9MB). Peak memory consumption was 118.2MB. 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: 1013]: 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 8 procedures, 208 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2285 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2270 mSDsluCounter, 5996 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2831 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 754 IncrementalHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 3165 mSDtfsCounter, 754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 743 GetRequests, 700 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=6, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 70 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 252 PreInvPairs, 321 NumberOfFragments, 2272 HoareAnnotationTreeSize, 252 FomulaSimplifications, 355 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 76 FomulaSimplificationsInter, 1317 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 1815 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2918 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 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: 43]: Loop Invariant Derived loop invariant: ((((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && pended == 0bv32) && NP == 1bv32) && s == 3bv32) && 7bv32 == IPC - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: ((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(DC == 2bv32)) || !(4bv32 == SKIP2)) || !(\old(s) == NP)) || NP == s) || !(7bv32 == IPC)) || !(pended == 0bv32)) || !(NP == 1bv32) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(DC == 2bv32)) || !(4bv32 == SKIP2)) || !(\old(s) == SKIP1)) || !(7bv32 == IPC)) || !(pended == 0bv32)) || s == 3bv32) || !(NP == 1bv32)) && (((((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || !(compRegistered == 1bv32)) || !(DC == 2bv32)) || (~sign_extendFrom8To32(3221225494bv32) == __cil_tmp7 && s == MPR1)) || !(4bv32 == SKIP2)) || !(\old(s) == NP)) || !(7bv32 == IPC)) || !(pended == 0bv32)) || !(NP == 1bv32)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: status == 0bv32 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((4bv32 == SKIP2 && 3bv32 == SKIP1) && DC == 2bv32) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: (((((((compRegistered == 1bv32 && 4bv32 == SKIP2) && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: ((((4bv32 == SKIP2 && 3bv32 == SKIP1) && DC == 2bv32) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((((((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(DC == 2bv32)) || !(4bv32 == SKIP2)) || !(\old(s) == SKIP1)) || !(7bv32 == IPC)) || !(pended == 0bv32)) || s == 3bv32) || !(NP == 1bv32)) && (((((((((((!(3bv32 == SKIP1) || ((~sign_extendFrom8To32(3221225494bv32) == __cil_tmp7 && returnVal2 == 0bv32) && s == MPR1)) || !(MPR1 == 5bv32)) || ((~sign_extendFrom8To32(3221225494bv32) == __cil_tmp7 && ~bvadd16(1073741823bv32, returnVal2) == 0bv32) && s == MPR1)) || !(compRegistered == 1bv32)) || !(DC == 2bv32)) || !(4bv32 == SKIP2)) || !(\old(s) == NP)) || !(7bv32 == IPC)) || (((returnVal2 == 259bv32 && ~sign_extendFrom8To32(3221225494bv32) == __cil_tmp7) && setEventCalled == 1bv32) && s == MPR1)) || !(pended == 0bv32)) || !(NP == 1bv32)) - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: ((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (((((((compRegistered == 1bv32 && 4bv32 == SKIP2) && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && pended == 0bv32) && NP == 1bv32) && s == 3bv32) && 7bv32 == IPC - InvariantResult [Line: 822]: Loop Invariant Derived loop invariant: ((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && pended == 0bv32) && NP == 1bv32) && s == 3bv32) && 7bv32 == IPC - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: (((((((compRegistered == 1bv32 && 4bv32 == SKIP2) && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((4bv32 == SKIP2 && 3bv32 == SKIP1) && DC == 2bv32) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: (((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(DC == 2bv32)) || !(4bv32 == SKIP2)) || !(\old(s) == NP)) || NP == s) || !(7bv32 == IPC)) || !(pended == 0bv32)) || !(NP == 1bv32) - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && pended == 0bv32) && NP == 1bv32) && s == 3bv32) && 7bv32 == IPC - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: ((((((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(DC == 2bv32)) || !(4bv32 == SKIP2)) || !(\old(s) == SKIP1)) || !(7bv32 == IPC)) || !(pended == 0bv32)) || s == 3bv32) || !(NP == 1bv32)) && (((((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || !(compRegistered == 1bv32)) || !(DC == 2bv32)) || !(4bv32 == SKIP2)) || !(\old(s) == NP)) || !(7bv32 == IPC)) || ((~sign_extendFrom8To32(3221225494bv32) == __cil_tmp7 && setEventCalled == 1bv32) && s == MPR1)) || !(pended == 0bv32)) || !(NP == 1bv32)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: ((((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || !(compRegistered == 1bv32)) || !(DC == 2bv32)) || !(4bv32 == SKIP2)) || !(NP == s)) || setEventCalled == 1bv32) || !(7bv32 == IPC)) || !(pended == 0bv32)) || !(NP == 1bv32) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: ((((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: ((((4bv32 == SKIP2 && 3bv32 == SKIP1) && DC == 2bv32) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: ((((((((!(3bv32 == SKIP1) || !(compRegistered == 0bv32)) || !(DC == 2bv32)) || !(4bv32 == SKIP2)) || !(\old(s) == SKIP1)) || !(7bv32 == IPC)) || !(pended == 0bv32)) || s == 3bv32) || !(NP == 1bv32)) && (((((((((!(3bv32 == SKIP1) || !(MPR1 == 5bv32)) || !(compRegistered == 1bv32)) || !(DC == 2bv32)) || (~sign_extendFrom8To32(3221225494bv32) == __cil_tmp7 && s == MPR1)) || !(4bv32 == SKIP2)) || !(\old(s) == NP)) || !(7bv32 == IPC)) || !(pended == 0bv32)) || !(NP == 1bv32)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && MPR1 == 5bv32) && compRegistered == 0bv32) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((4bv32 == SKIP2 && 3bv32 == SKIP1) && status == 0bv32) && DC == 2bv32) && compRegistered == 0bv32) && NP == s) && pended == 0bv32) && NP == 1bv32) && 7bv32 == IPC RESULT: Ultimate proved your program to be correct! [2022-01-10 04:10:13,584 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...