/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:41:47,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:41:47,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:41:47,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:41:47,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:41:47,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:41:47,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:41:47,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:41:47,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:41:47,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:41:47,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:41:47,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:41:47,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:41:47,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:41:47,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:41:47,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:41:47,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:41:47,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:41:47,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:41:47,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:41:47,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:41:47,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:41:47,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:41:47,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:41:47,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:41:47,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:41:47,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:41:47,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:41:47,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:41:47,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:41:47,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:41:47,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:41:47,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:41:47,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:41:47,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:41:47,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:41:47,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:41:47,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:41:47,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:41:47,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:41:47,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:41:47,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 21:41:47,917 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:41:47,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:41:47,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:41:47,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:41:47,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:41:47,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:41:47,918 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:41:47,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:41:47,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:41:47,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:41:47,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:41:47,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:41:47,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:41:47,919 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:41:47,921 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:41:47,921 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:41:47,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:41:47,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:41:47,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:41:47,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:41:47,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:41:47,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:41:47,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:41:47,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:41:47,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:41:47,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:41:47,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:41:47,922 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:41:47,923 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:41:47,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:41:47,923 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:41:47,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:41:47,924 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:41:47,924 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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 21:41:48,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:41:48,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:41:48,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:41:48,098 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:41:48,099 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:41:48,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-01-10 21:41:48,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca5d3de1/8699ad5837b94622a2e2aefb1bd8cbbb/FLAG21162fadf [2022-01-10 21:41:48,548 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:41:48,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-01-10 21:41:48,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca5d3de1/8699ad5837b94622a2e2aefb1bd8cbbb/FLAG21162fadf [2022-01-10 21:41:48,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca5d3de1/8699ad5837b94622a2e2aefb1bd8cbbb [2022-01-10 21:41:48,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:41:48,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:41:48,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:41:48,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:41:48,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:41:48,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:41:48" (1/1) ... [2022-01-10 21:41:48,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44975a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:48, skipping insertion in model container [2022-01-10 21:41:48,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:41:48" (1/1) ... [2022-01-10 21:41:48,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:41:48,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:41:49,133 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_simpl1.cil.c[17080,17093] [2022-01-10 21:41:49,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:41:49,166 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:41:49,224 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_simpl1.cil.c[17080,17093] [2022-01-10 21:41:49,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:41:49,239 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:41:49,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49 WrapperNode [2022-01-10 21:41:49,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:41:49,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:41:49,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:41:49,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:41:49,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:49,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:49,282 INFO L137 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 24, calls inlined = 39, statements flattened = 674 [2022-01-10 21:41:49,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:41:49,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:41:49,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:41:49,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:41:49,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:49,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:49,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:49,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:49,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:49,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:49,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:49,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:41:49,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:41:49,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:41:49,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:41:49,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:49,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:41:49,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:41:49,363 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 21:41:49,369 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 21:41:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:41:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:41:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:41:49,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:41:49,470 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:41:49,471 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:41:49,477 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:49,481 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:49,485 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:49,488 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:49,492 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:49,497 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:49,501 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:49,894 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume !false; [2022-01-10 21:41:49,894 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume false; [2022-01-10 21:41:49,894 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##184: assume false; [2022-01-10 21:41:49,894 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##185: assume !false; [2022-01-10 21:41:49,894 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2022-01-10 21:41:49,894 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2022-01-10 21:41:49,894 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !false; [2022-01-10 21:41:49,895 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume false; [2022-01-10 21:41:49,895 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-01-10 21:41:49,895 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-01-10 21:41:49,895 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2022-01-10 21:41:49,895 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2022-01-10 21:41:49,895 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2022-01-10 21:41:49,895 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2022-01-10 21:41:49,895 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:41:49,901 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:41:49,901 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 21:41:49,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:49 BoogieIcfgContainer [2022-01-10 21:41:49,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:41:49,903 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:41:49,907 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:41:49,908 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:41:49,910 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:49" (1/1) ... [2022-01-10 21:41:50,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:41:50 BasicIcfg [2022-01-10 21:41:50,082 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:41:50,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:41:50,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:41:50,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:41:50,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:41:48" (1/4) ... [2022-01-10 21:41:50,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c039244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:41:50, skipping insertion in model container [2022-01-10 21:41:50,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:49" (2/4) ... [2022-01-10 21:41:50,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c039244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:41:50, skipping insertion in model container [2022-01-10 21:41:50,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:49" (3/4) ... [2022-01-10 21:41:50,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c039244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:41:50, skipping insertion in model container [2022-01-10 21:41:50,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:41:50" (4/4) ... [2022-01-10 21:41:50,087 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.cTransformedIcfg [2022-01-10 21:41:50,091 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:41:50,091 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-01-10 21:41:50,147 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:41:50,152 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 21:41:50,152 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-01-10 21:41:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 196 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 195 states have internal predecessors, (281), 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 21:41:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 21:41:50,174 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:50,174 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:50,175 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 471669625, now seen corresponding path program 1 times [2022-01-10 21:41:50,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:50,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639860297] [2022-01-10 21:41:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:50,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:50,403 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 21:41:50,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:50,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639860297] [2022-01-10 21:41:50,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639860297] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:50,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:50,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:50,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828789886] [2022-01-10 21:41:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:50,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:50,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:50,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:50,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:50,439 INFO L87 Difference]: Start difference. First operand has 196 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 195 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 21:41:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:50,610 INFO L93 Difference]: Finished difference Result 334 states and 477 transitions. [2022-01-10 21:41:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:50,612 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 21:41:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:50,618 INFO L225 Difference]: With dead ends: 334 [2022-01-10 21:41:50,624 INFO L226 Difference]: Without dead ends: 172 [2022-01-10 21:41:50,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:50,629 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 8 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:50,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 417 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-01-10 21:41:50,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-01-10 21:41:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 156 states have (on average 1.4679487179487178) internal successors, (229), 171 states have internal predecessors, (229), 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 21:41:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2022-01-10 21:41:50,670 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 12 [2022-01-10 21:41:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:50,671 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2022-01-10 21:41:50,671 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), 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 21:41:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-01-10 21:41:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 21:41:50,671 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:50,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:50,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:41:50,672 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:50,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1849014411, now seen corresponding path program 1 times [2022-01-10 21:41:50,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:50,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458365607] [2022-01-10 21:41:50,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:50,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:50,781 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 21:41:50,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:50,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458365607] [2022-01-10 21:41:50,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458365607] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:50,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:50,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:50,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309440743] [2022-01-10 21:41:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:50,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:50,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:50,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:50,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:50,785 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 21:41:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:50,887 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2022-01-10 21:41:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:50,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 21:41:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:50,889 INFO L225 Difference]: With dead ends: 259 [2022-01-10 21:41:50,889 INFO L226 Difference]: Without dead ends: 207 [2022-01-10 21:41:50,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:50,890 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 108 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:50,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 335 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-01-10 21:41:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2022-01-10 21:41:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 183 states have (on average 1.4262295081967213) internal successors, (261), 193 states have internal predecessors, (261), 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 21:41:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 261 transitions. [2022-01-10 21:41:50,911 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 261 transitions. Word has length 15 [2022-01-10 21:41:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:50,911 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 261 transitions. [2022-01-10 21:41:50,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 21:41:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 261 transitions. [2022-01-10 21:41:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 21:41:50,912 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:50,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:50,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:41:50,912 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:50,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1484873669, now seen corresponding path program 1 times [2022-01-10 21:41:50,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:50,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200513906] [2022-01-10 21:41:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:50,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:50,990 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 21:41:50,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:50,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200513906] [2022-01-10 21:41:50,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200513906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:50,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:50,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:50,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073432124] [2022-01-10 21:41:50,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:50,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:50,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:50,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:50,992 INFO L87 Difference]: Start difference. First operand 194 states and 261 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 21:41:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,053 INFO L93 Difference]: Finished difference Result 305 states and 403 transitions. [2022-01-10 21:41:51,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:51,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 21:41:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,054 INFO L225 Difference]: With dead ends: 305 [2022-01-10 21:41:51,054 INFO L226 Difference]: Without dead ends: 219 [2022-01-10 21:41:51,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,055 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 168 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:51,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 260 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-01-10 21:41:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 174. [2022-01-10 21:41:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 167 states have (on average 1.4251497005988023) internal successors, (238), 173 states have internal predecessors, (238), 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 21:41:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 238 transitions. [2022-01-10 21:41:51,064 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 238 transitions. Word has length 16 [2022-01-10 21:41:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,064 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 238 transitions. [2022-01-10 21:41:51,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 21:41:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 238 transitions. [2022-01-10 21:41:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 21:41:51,065 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:51,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:41:51,065 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash 322985897, now seen corresponding path program 1 times [2022-01-10 21:41:51,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711378249] [2022-01-10 21:41:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,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 21:41:51,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711378249] [2022-01-10 21:41:51,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711378249] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:51,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307645896] [2022-01-10 21:41:51,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:51,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,102 INFO L87 Difference]: Start difference. First operand 174 states and 238 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:41:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,177 INFO L93 Difference]: Finished difference Result 174 states and 238 transitions. [2022-01-10 21:41:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:51,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 21:41:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,178 INFO L225 Difference]: With dead ends: 174 [2022-01-10 21:41:51,178 INFO L226 Difference]: Without dead ends: 168 [2022-01-10 21:41:51,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,186 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 32 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:51,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 281 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-01-10 21:41:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-01-10 21:41:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 164 states have (on average 1.4146341463414633) internal successors, (232), 167 states have internal predecessors, (232), 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 21:41:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 232 transitions. [2022-01-10 21:41:51,202 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 232 transitions. Word has length 24 [2022-01-10 21:41:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,202 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 232 transitions. [2022-01-10 21:41:51,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:41:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 232 transitions. [2022-01-10 21:41:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 21:41:51,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,204 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] [2022-01-10 21:41:51,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:41:51,204 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1260626318, now seen corresponding path program 1 times [2022-01-10 21:41:51,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956299853] [2022-01-10 21:41:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,265 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 21:41:51,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956299853] [2022-01-10 21:41:51,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956299853] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:51,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275143493] [2022-01-10 21:41:51,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:51,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:51,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,273 INFO L87 Difference]: Start difference. First operand 168 states and 232 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 21:41:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,330 INFO L93 Difference]: Finished difference Result 213 states and 290 transitions. [2022-01-10 21:41:51,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:51,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-01-10 21:41:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,332 INFO L225 Difference]: With dead ends: 213 [2022-01-10 21:41:51,332 INFO L226 Difference]: Without dead ends: 165 [2022-01-10 21:41:51,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,334 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:51,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 326 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-01-10 21:41:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-01-10 21:41:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 162 states have (on average 1.4074074074074074) internal successors, (228), 164 states have internal predecessors, (228), 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 21:41:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 228 transitions. [2022-01-10 21:41:51,345 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 228 transitions. Word has length 28 [2022-01-10 21:41:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,345 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 228 transitions. [2022-01-10 21:41:51,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 21:41:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 228 transitions. [2022-01-10 21:41:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 21:41:51,350 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,350 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] [2022-01-10 21:41:51,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:41:51,350 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash -720730173, now seen corresponding path program 1 times [2022-01-10 21:41:51,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676890894] [2022-01-10 21:41:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:41:51,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676890894] [2022-01-10 21:41:51,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676890894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:51,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034305191] [2022-01-10 21:41:51,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:51,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:51,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,406 INFO L87 Difference]: Start difference. First operand 165 states and 228 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 21:41:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,419 INFO L93 Difference]: Finished difference Result 225 states and 304 transitions. [2022-01-10 21:41:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:51,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-01-10 21:41:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,420 INFO L225 Difference]: With dead ends: 225 [2022-01-10 21:41:51,420 INFO L226 Difference]: Without dead ends: 173 [2022-01-10 21:41:51,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,423 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 64 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 332 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 21:41:51,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 332 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-01-10 21:41:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2022-01-10 21:41:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 155 states have (on average 1.4064516129032258) internal successors, (218), 157 states have internal predecessors, (218), 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 21:41:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 218 transitions. [2022-01-10 21:41:51,430 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 218 transitions. Word has length 28 [2022-01-10 21:41:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,430 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 218 transitions. [2022-01-10 21:41:51,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 21:41:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 218 transitions. [2022-01-10 21:41:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 21:41:51,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,433 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] [2022-01-10 21:41:51,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:41:51,434 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:51,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash 256580806, now seen corresponding path program 1 times [2022-01-10 21:41:51,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422332990] [2022-01-10 21:41:51,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,484 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 21:41:51,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422332990] [2022-01-10 21:41:51,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422332990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:51,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001138910] [2022-01-10 21:41:51,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:51,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:51,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,486 INFO L87 Difference]: Start difference. First operand 158 states and 218 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 21:41:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,537 INFO L93 Difference]: Finished difference Result 188 states and 257 transitions. [2022-01-10 21:41:51,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:51,538 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 21:41:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,540 INFO L225 Difference]: With dead ends: 188 [2022-01-10 21:41:51,540 INFO L226 Difference]: Without dead ends: 186 [2022-01-10 21:41:51,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,541 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 25 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:51,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 333 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-01-10 21:41:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2022-01-10 21:41:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 159 states have (on average 1.4088050314465408) internal successors, (224), 161 states have internal predecessors, (224), 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 21:41:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2022-01-10 21:41:51,546 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 32 [2022-01-10 21:41:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,547 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2022-01-10 21:41:51,547 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), 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 21:41:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2022-01-10 21:41:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 21:41:51,549 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,549 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] [2022-01-10 21:41:51,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:41:51,549 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:51,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 257566888, now seen corresponding path program 1 times [2022-01-10 21:41:51,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507380025] [2022-01-10 21:41:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,624 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 21:41:51,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507380025] [2022-01-10 21:41:51,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507380025] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:51,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190082376] [2022-01-10 21:41:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:51,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:51,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:51,627 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 21:41:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,704 INFO L93 Difference]: Finished difference Result 209 states and 285 transitions. [2022-01-10 21:41:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 21:41:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,705 INFO L225 Difference]: With dead ends: 209 [2022-01-10 21:41:51,705 INFO L226 Difference]: Without dead ends: 162 [2022-01-10 21:41:51,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:51,706 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 168 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:51,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 279 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-01-10 21:41:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-01-10 21:41:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 159 states have (on average 1.4025157232704402) internal successors, (223), 161 states have internal predecessors, (223), 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 21:41:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 223 transitions. [2022-01-10 21:41:51,713 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 223 transitions. Word has length 32 [2022-01-10 21:41:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,714 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 223 transitions. [2022-01-10 21:41:51,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 21:41:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 223 transitions. [2022-01-10 21:41:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:51,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,714 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 21:41:51,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:41:51,714 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,715 INFO L85 PathProgramCache]: Analyzing trace with hash 832523037, now seen corresponding path program 1 times [2022-01-10 21:41:51,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311864967] [2022-01-10 21:41:51,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,752 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 21:41:51,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311864967] [2022-01-10 21:41:51,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311864967] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:51,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262876391] [2022-01-10 21:41:51,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:51,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,754 INFO L87 Difference]: Start difference. First operand 162 states and 223 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 21:41:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,769 INFO L93 Difference]: Finished difference Result 169 states and 233 transitions. [2022-01-10 21:41:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:51,769 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-10 21:41:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,770 INFO L225 Difference]: With dead ends: 169 [2022-01-10 21:41:51,770 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 21:41:51,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,772 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:51,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 175 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 21:41:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-01-10 21:41:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:41:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-01-10 21:41:51,775 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 33 [2022-01-10 21:41:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,775 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-01-10 21:41:51,775 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), 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 21:41:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-01-10 21:41:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 21:41:51,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,776 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 21:41:51,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:41:51,776 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 814703856, now seen corresponding path program 1 times [2022-01-10 21:41:51,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298482471] [2022-01-10 21:41:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,821 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 21:41:51,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298482471] [2022-01-10 21:41:51,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298482471] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:51,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073384305] [2022-01-10 21:41:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:51,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:51,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,823 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 21:41:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,832 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-01-10 21:41:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:51,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-10 21:41:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,834 INFO L225 Difference]: With dead ends: 93 [2022-01-10 21:41:51,834 INFO L226 Difference]: Without dead ends: 71 [2022-01-10 21:41:51,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,835 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 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 21:41:51,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-10 21:41:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2022-01-10 21:41:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 61 states have internal predecessors, (71), 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 21:41:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-01-10 21:41:51,840 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 34 [2022-01-10 21:41:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,840 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-01-10 21:41:51,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 21:41:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-01-10 21:41:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:51,843 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,843 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 21:41:51,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:41:51,844 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1941968994, now seen corresponding path program 1 times [2022-01-10 21:41:51,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949268392] [2022-01-10 21:41:51,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,890 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 21:41:51,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949268392] [2022-01-10 21:41:51,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949268392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:51,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763879940] [2022-01-10 21:41:51,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:51,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:51,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,893 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 21:41:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,901 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-01-10 21:41:51,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:51,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-10 21:41:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,902 INFO L225 Difference]: With dead ends: 73 [2022-01-10 21:41:51,902 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 21:41:51,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,903 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 23 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 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 21:41:51,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 21:41:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 21:41:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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 21:41:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-01-10 21:41:51,906 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 35 [2022-01-10 21:41:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,906 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-01-10 21:41:51,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 21:41:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-01-10 21:41:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:51,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,907 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 21:41:51,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:41:51,907 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,908 INFO L85 PathProgramCache]: Analyzing trace with hash 181784100, now seen corresponding path program 1 times [2022-01-10 21:41:51,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617096602] [2022-01-10 21:41:51,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,939 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 21:41:51,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617096602] [2022-01-10 21:41:51,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617096602] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:51,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715300780] [2022-01-10 21:41:51,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:51,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:51,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,940 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 21:41:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,946 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-01-10 21:41:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:51,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-10 21:41:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,947 INFO L225 Difference]: With dead ends: 66 [2022-01-10 21:41:51,947 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 21:41:51,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,947 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 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 21:41:51,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 21:41:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-01-10 21:41:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 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 21:41:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-01-10 21:41:51,950 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 35 [2022-01-10 21:41:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,950 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-01-10 21:41:51,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 21:41:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-01-10 21:41:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:51,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,951 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 21:41:51,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:41:51,951 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1486084540, now seen corresponding path program 1 times [2022-01-10 21:41:51,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233088990] [2022-01-10 21:41:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:52,040 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 21:41:52,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:52,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233088990] [2022-01-10 21:41:52,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233088990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:52,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:52,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:52,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513263248] [2022-01-10 21:41:52,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:52,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:52,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:52,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:52,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:52,042 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 21:41:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:52,067 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-01-10 21:41:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:52,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-10 21:41:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:52,069 INFO L225 Difference]: With dead ends: 49 [2022-01-10 21:41:52,069 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 21:41:52,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:52,070 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 53 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:52,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 125 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 21:41:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-01-10 21:41:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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 21:41:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-01-10 21:41:52,073 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2022-01-10 21:41:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:52,074 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-01-10 21:41:52,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 21:41:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-01-10 21:41:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:52,075 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:52,075 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] [2022-01-10 21:41:52,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:41:52,077 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1175058253, now seen corresponding path program 1 times [2022-01-10 21:41:52,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:52,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347701505] [2022-01-10 21:41:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:52,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:52,134 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 21:41:52,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:52,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347701505] [2022-01-10 21:41:52,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347701505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:52,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:52,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:52,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366589439] [2022-01-10 21:41:52,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:52,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:52,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:52,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:52,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:52,136 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 21:41:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:52,149 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-01-10 21:41:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:52,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 21:41:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:52,161 INFO L225 Difference]: With dead ends: 86 [2022-01-10 21:41:52,161 INFO L226 Difference]: Without dead ends: 82 [2022-01-10 21:41:52,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:52,162 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:52,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 88 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-10 21:41:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-01-10 21:41:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.1) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:41:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2022-01-10 21:41:52,169 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 36 [2022-01-10 21:41:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:52,169 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2022-01-10 21:41:52,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 21:41:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2022-01-10 21:41:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:52,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:52,170 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] [2022-01-10 21:41:52,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:41:52,170 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1175028462, now seen corresponding path program 1 times [2022-01-10 21:41:52,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:52,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374720465] [2022-01-10 21:41:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:52,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:52,278 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 21:41:52,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:52,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374720465] [2022-01-10 21:41:52,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374720465] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:52,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:52,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:52,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281754645] [2022-01-10 21:41:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:52,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:52,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:52,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:52,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:52,280 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 21:41:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:52,303 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-01-10 21:41:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:52,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 21:41:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:52,304 INFO L225 Difference]: With dead ends: 89 [2022-01-10 21:41:52,304 INFO L226 Difference]: Without dead ends: 81 [2022-01-10 21:41:52,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:52,305 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 51 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:52,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 125 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-10 21:41:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-01-10 21:41:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 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 21:41:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-01-10 21:41:52,310 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 36 [2022-01-10 21:41:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:52,310 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-01-10 21:41:52,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 21:41:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-01-10 21:41:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 21:41:52,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:52,311 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] [2022-01-10 21:41:52,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 21:41:52,311 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-01-10 21:41:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash 638131039, now seen corresponding path program 1 times [2022-01-10 21:41:52,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:52,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982987296] [2022-01-10 21:41:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:52,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:52,341 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 21:41:52,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:52,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982987296] [2022-01-10 21:41:52,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982987296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:52,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:52,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:52,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059942423] [2022-01-10 21:41:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:52,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:52,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:52,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:52,343 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 21:41:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:52,353 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-01-10 21:41:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:52,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-01-10 21:41:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:52,353 INFO L225 Difference]: With dead ends: 81 [2022-01-10 21:41:52,354 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 21:41:52,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:52,354 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:52,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 21:41:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 21:41:52,355 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 21:41:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 21:41:52,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-01-10 21:41:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:52,355 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 21:41:52,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 21:41:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 21:41:52,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 21:41:52,357 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-01-10 21:41:52,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-01-10 21:41:52,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-01-10 21:41:52,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-01-10 21:41:52,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-01-10 21:41:52,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-01-10 21:41:52,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 21:41:52,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 21:41:52,902 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 21:41:52,902 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 21:41:52,903 INFO L854 garLoopResultBuilder]: At program point L70(lines 51 72) the Hoare annotation is: (and (<= ~myStatus~0Int 0) (= ~s~0Int ~UNLOADED~0Int) (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (not (= (+ ~MPR3~0Int (* (- 1) ~s~0Int)) 0))) [2022-01-10 21:41:52,903 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 368) no Hoare annotation was computed. [2022-01-10 21:41:52,903 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 335) no Hoare annotation was computed. [2022-01-10 21:41:52,903 INFO L854 garLoopResultBuilder]: At program point L323-1(lines 297 421) the Hoare annotation is: (or (= ~s~0Int ~UNLOADED~0Int) (and (= ~NP~0Int 1) (<= 5 ~MPR1~0Int) (not (= ~pended~0Int 1)))) [2022-01-10 21:41:52,903 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2022-01-10 21:41:52,903 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-01-10 21:41:52,903 INFO L854 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (or (and (not (= (+ (- 1) ~pended~0Int) 0)) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int)) (= ~s~0Int ~UNLOADED~0Int)) [2022-01-10 21:41:52,903 INFO L854 garLoopResultBuilder]: At program point L48(lines 37 50) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~compRegistered~0Int 0) (= ~NP~0Int ~s~0Int) (<= 5 ~MPR1~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,903 INFO L858 garLoopResultBuilder]: For program point L385(lines 369 418) no Hoare annotation was computed. [2022-01-10 21:41:52,903 INFO L858 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-01-10 21:41:52,903 INFO L854 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (or (and (not (= (+ (- 1) ~pended~0Int) 0)) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int)) (= ~s~0Int ~UNLOADED~0Int)) [2022-01-10 21:41:52,903 INFO L858 garLoopResultBuilder]: For program point L340(lines 340 345) no Hoare annotation was computed. [2022-01-10 21:41:52,903 INFO L861 garLoopResultBuilder]: At program point L420(lines 288 422) the Hoare annotation is: true [2022-01-10 21:41:52,903 INFO L858 garLoopResultBuilder]: For program point L386(lines 386 415) no Hoare annotation was computed. [2022-01-10 21:41:52,903 INFO L858 garLoopResultBuilder]: For program point L340-2(lines 339 349) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 414) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L352(lines 352 367) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int)) [2022-01-10 21:41:52,904 INFO L854 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~compRegistered~0Int 0) (= ~NP~0Int ~s~0Int) (<= 5 ~MPR1~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,904 INFO L861 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: true [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L389(lines 389 391) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L398(lines 398 402) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L404(lines 404 412) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 284) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L581-15(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L405(lines 405 407) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L409(lines 409 411) no Hoare annotation was computed. [2022-01-10 21:41:52,904 INFO L854 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~compRegistered~0Int 0) (= ~NP~0Int ~s~0Int) (<= 5 ~MPR1~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,904 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 283) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L854 garLoopResultBuilder]: At program point L582-15(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point L171(lines 171 183) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L854 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (and (= (+ ~NP~0Int (* (- 1) ~s~0Int)) 0) (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int)) [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 282) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point L581(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 182) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point L216(lines 216 222) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L854 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (and (= (+ ~NP~0Int (* (- 1) ~s~0Int)) 0) (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int)) [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 281) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L854 garLoopResultBuilder]: At program point L582(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point L581-1(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point L176-2(lines 171 183) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point L216-2(lines 216 222) no Hoare annotation was computed. [2022-01-10 21:41:52,905 INFO L858 garLoopResultBuilder]: For program point L581-6(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 238) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L854 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (and (= (+ ~NP~0Int (* (- 1) ~s~0Int)) 0) (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int)) [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 280) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L854 garLoopResultBuilder]: At program point L582-1(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point L445(lines 445 448) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point L445-3(lines 445 448) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L854 garLoopResultBuilder]: At program point L582-6(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point L232-2(lines 232 238) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point L581-9(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point L247-1(lines 247 253) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point L581-12(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 279) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L854 garLoopResultBuilder]: At program point L520(lines 515 522) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~NP~0Int ~s~0Int) (= ~setEventCalled~0Int 1) (<= 5 ~MPR1~0Int) (<= 1 ~compRegistered~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,906 INFO L858 garLoopResultBuilder]: For program point L445-2(lines 445 448) no Hoare annotation was computed. [2022-01-10 21:41:52,906 INFO L854 garLoopResultBuilder]: At program point L520-1(lines 515 522) the Hoare annotation is: false [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point L445-5(lines 445 448) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point L445-6(lines 445 448) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L854 garLoopResultBuilder]: At program point L582-9(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point L445-9(lines 445 448) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L854 garLoopResultBuilder]: At program point L582-12(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 278) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L854 garLoopResultBuilder]: At program point L573(lines 565 575) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~NP~0Int ~s~0Int) (= ~setEventCalled~0Int 1) (<= 5 ~MPR1~0Int) (<= 1 ~compRegistered~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 474) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L854 garLoopResultBuilder]: At program point L573-1(lines 565 575) the Hoare annotation is: false [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point L451-1(lines 451 474) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L854 garLoopResultBuilder]: At program point L520-2(lines 515 522) the Hoare annotation is: false [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point L445-8(lines 445 448) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L854 garLoopResultBuilder]: At program point L520-3(lines 515 522) the Hoare annotation is: false [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point L445-11(lines 445 448) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 277) no Hoare annotation was computed. [2022-01-10 21:41:52,907 INFO L858 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2022-01-10 21:41:52,908 INFO L854 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~setEventCalled~0Int 1) (<= 5 ~MPR1~0Int) (<= 1 ~compRegistered~0Int) (= ~MPR1~0Int ~s~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,908 INFO L858 garLoopResultBuilder]: For program point L456(lines 456 473) no Hoare annotation was computed. [2022-01-10 21:41:52,908 INFO L858 garLoopResultBuilder]: For program point L427-3(lines 427 433) no Hoare annotation was computed. [2022-01-10 21:41:52,908 INFO L854 garLoopResultBuilder]: At program point L452-1(lines 451 474) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,908 INFO L858 garLoopResultBuilder]: For program point L456-1(lines 456 473) no Hoare annotation was computed. [2022-01-10 21:41:52,908 INFO L854 garLoopResultBuilder]: At program point L573-2(lines 565 575) the Hoare annotation is: false [2022-01-10 21:41:52,908 INFO L858 garLoopResultBuilder]: For program point L451-2(lines 451 474) no Hoare annotation was computed. [2022-01-10 21:41:52,908 INFO L854 garLoopResultBuilder]: At program point L573-3(lines 565 575) the Hoare annotation is: false [2022-01-10 21:41:52,908 INFO L858 garLoopResultBuilder]: For program point L451-3(lines 451 474) no Hoare annotation was computed. [2022-01-10 21:41:52,908 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 276) no Hoare annotation was computed. [2022-01-10 21:41:52,908 INFO L854 garLoopResultBuilder]: At program point L427-2(lines 423 436) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~setEventCalled~0Int 1) (<= 5 ~MPR1~0Int) (<= 1 ~compRegistered~0Int) (= ~MPR1~0Int ~s~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,908 INFO L858 garLoopResultBuilder]: For program point L581-2(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,908 INFO L854 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse0 (= ~NP~0Int 1)) (.cse1 (= ~setEventCalled~0Int 1)) (.cse2 (<= 5 ~MPR1~0Int)) (.cse3 (<= 1 ~compRegistered~0Int)) (.cse4 (= ~MPR1~0Int ~s~0Int)) (.cse5 (not (= ~pended~0Int 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 3221225473 |ULTIMATE.start_ULTIMATE.start_IofCallDriver_~returnVal2~0#1Int|) .cse4 .cse5) (and (<= 259 |ULTIMATE.start_ULTIMATE.start_IofCallDriver_~returnVal2~0#1Int|) .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_IofCallDriver_~returnVal2~0#1Int| 259) .cse2 .cse3 .cse4 .cse5) (and (<= |ULTIMATE.start_ULTIMATE.start_IofCallDriver_~returnVal2~0#1Int| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-01-10 21:41:52,908 INFO L854 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~setEventCalled~0Int 1) (<= 5 ~MPR1~0Int) (<= 1 ~compRegistered~0Int) (= ~MPR1~0Int ~s~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,908 INFO L854 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~setEventCalled~0Int 1) (<= 5 ~MPR1~0Int) (<= 1 ~compRegistered~0Int) (= ~MPR1~0Int ~s~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,908 INFO L854 garLoopResultBuilder]: At program point L427-5(lines 423 436) the Hoare annotation is: false [2022-01-10 21:41:52,909 INFO L858 garLoopResultBuilder]: For program point L581-7(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,909 INFO L854 garLoopResultBuilder]: At program point L471-1(lines 444 499) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,909 INFO L854 garLoopResultBuilder]: At program point L457-1(lines 456 473) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,909 INFO L854 garLoopResultBuilder]: At program point L459-1(lines 458 473) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,909 INFO L858 garLoopResultBuilder]: For program point L427-6(lines 427 433) no Hoare annotation was computed. [2022-01-10 21:41:52,909 INFO L854 garLoopResultBuilder]: At program point L452-2(lines 451 474) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,909 INFO L858 garLoopResultBuilder]: For program point L456-2(lines 456 473) no Hoare annotation was computed. [2022-01-10 21:41:52,909 INFO L858 garLoopResultBuilder]: For program point L427-9(lines 427 433) no Hoare annotation was computed. [2022-01-10 21:41:52,909 INFO L854 garLoopResultBuilder]: At program point L452-3(lines 451 474) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,909 INFO L858 garLoopResultBuilder]: For program point L456-3(lines 456 473) no Hoare annotation was computed. [2022-01-10 21:41:52,909 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 275) no Hoare annotation was computed. [2022-01-10 21:41:52,909 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,909 INFO L854 garLoopResultBuilder]: At program point L582-2(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,909 INFO L858 garLoopResultBuilder]: For program point L488-2(lines 475 497) no Hoare annotation was computed. [2022-01-10 21:41:52,909 INFO L858 garLoopResultBuilder]: For program point L479(lines 479 496) no Hoare annotation was computed. [2022-01-10 21:41:52,910 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,910 INFO L854 garLoopResultBuilder]: At program point L582-7(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,910 INFO L858 garLoopResultBuilder]: For program point L488-5(lines 475 497) no Hoare annotation was computed. [2022-01-10 21:41:52,910 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 479 496) no Hoare annotation was computed. [2022-01-10 21:41:52,910 INFO L854 garLoopResultBuilder]: At program point L427-8(lines 423 436) the Hoare annotation is: false [2022-01-10 21:41:52,910 INFO L858 garLoopResultBuilder]: For program point L581-10(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,910 INFO L854 garLoopResultBuilder]: At program point L471-2(lines 444 499) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,910 INFO L854 garLoopResultBuilder]: At program point L457-2(lines 456 473) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,910 INFO L854 garLoopResultBuilder]: At program point L459-2(lines 458 473) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,910 INFO L854 garLoopResultBuilder]: At program point L427-11(lines 423 436) the Hoare annotation is: false [2022-01-10 21:41:52,910 INFO L858 garLoopResultBuilder]: For program point L581-13(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,910 INFO L854 garLoopResultBuilder]: At program point L471-3(lines 444 499) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,910 INFO L854 garLoopResultBuilder]: At program point L457-3(lines 456 473) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,910 INFO L854 garLoopResultBuilder]: At program point L459-3(lines 458 473) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= ~compRegistered~0Int 0) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (= (+ (* (- 1) ~s~0Int) ~SKIP1~0Int) 0)) [2022-01-10 21:41:52,910 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 274) no Hoare annotation was computed. [2022-01-10 21:41:52,910 INFO L854 garLoopResultBuilder]: At program point L498(lines 437 500) the Hoare annotation is: (let ((.cse0 (= ~NP~0Int 1)) (.cse1 (= ~setEventCalled~0Int 1)) (.cse2 (<= 5 ~MPR1~0Int)) (.cse3 (<= 1 ~compRegistered~0Int)) (.cse4 (not (= ~pended~0Int 1)))) (or (and .cse0 (= ~NP~0Int ~s~0Int) .cse1 .cse2 .cse3 .cse4) (and (<= 259 |ULTIMATE.start_ULTIMATE.start_IofCallDriver_#res#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_IofCallDriver_#res#1Int| 259) (<= 259 |ULTIMATE.start_ULTIMATE.start_IofCallDriver_~returnVal2~0#1Int|) .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_IofCallDriver_~returnVal2~0#1Int| 259) .cse2 .cse3 (= ~MPR3~0Int ~s~0Int) .cse4))) [2022-01-10 21:41:52,910 INFO L858 garLoopResultBuilder]: For program point L480(lines 480 486) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 495) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L854 garLoopResultBuilder]: At program point L498-1(lines 437 500) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~compRegistered~0Int 0) (<= 5 ~MPR1~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L480-3(lines 480 486) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L488-3(lines 488 495) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L854 garLoopResultBuilder]: At program point L582-10(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L488-8(lines 475 497) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L479-2(lines 479 496) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L854 garLoopResultBuilder]: At program point L582-13(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L488-11(lines 475 497) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L479-3(lines 479 496) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 273) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 198) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L581-3(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L854 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: (and (= ~NP~0Int 1) (<= 5 ~MPR1~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,911 INFO L858 garLoopResultBuilder]: For program point L581-8(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,911 INFO L854 garLoopResultBuilder]: At program point L498-2(lines 437 500) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~compRegistered~0Int 0) (<= 5 ~MPR1~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L480-6(lines 480 486) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L488-6(lines 488 495) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L854 garLoopResultBuilder]: At program point L498-3(lines 437 500) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~compRegistered~0Int 0) (<= 5 ~MPR1~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L480-9(lines 480 486) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L488-9(lines 488 495) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 272) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 547) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L854 garLoopResultBuilder]: At program point L582-3(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,912 INFO L854 garLoopResultBuilder]: At program point L285(lines 75 287) the Hoare annotation is: (and (= ~NP~0Int 1) (<= 5 ~MPR1~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L854 garLoopResultBuilder]: At program point L582-8(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L581-11(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L581-14(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 271) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L858 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-01-10 21:41:52,912 INFO L854 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: (let ((.cse0 (* (- 1) ~s~0Int))) (and (= (+ ~NP~0Int .cse0) 0) (not (= (+ (- 1) ~pended~0Int) 0)) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (not (= (+ ~MPR3~0Int .cse0) 0)) (<= 1 ~compRegistered~0Int))) [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L201(lines 201 205) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 206) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L854 garLoopResultBuilder]: At program point L582-11(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L854 garLoopResultBuilder]: At program point L582-14(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 270) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L541-2(lines 528 547) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L505(lines 505 511) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 269) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L550(lines 550 562) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L581-4(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L854 garLoopResultBuilder]: At program point L505-2(lines 501 514) the Hoare annotation is: (and (not (= (+ (- 1) ~pended~0Int) 0)) (= (+ (- 1) ~NP~0Int) 0) (<= 5 ~MPR1~0Int) (<= 1 ~compRegistered~0Int)) [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L581-5(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 268) no Hoare annotation was computed. [2022-01-10 21:41:52,913 INFO L854 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~NP~0Int ~s~0Int) (<= 5 ~MPR1~0Int) (<= 1 ~compRegistered~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,913 INFO L854 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~NP~0Int ~s~0Int) (<= 5 ~MPR1~0Int) (<= 1 ~compRegistered~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,913 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,914 INFO L854 garLoopResultBuilder]: At program point L582-4(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,914 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-01-10 21:41:52,914 INFO L854 garLoopResultBuilder]: At program point L582-5(lines 577 584) the Hoare annotation is: false [2022-01-10 21:41:52,914 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 267) no Hoare annotation was computed. [2022-01-10 21:41:52,914 INFO L854 garLoopResultBuilder]: At program point L523(lines 523 564) the Hoare annotation is: (and (= ~NP~0Int 1) (= ~NP~0Int ~s~0Int) (<= 5 ~MPR1~0Int) (<= 1 ~compRegistered~0Int) (not (= ~pended~0Int 1))) [2022-01-10 21:41:52,914 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 266) no Hoare annotation was computed. [2022-01-10 21:41:52,914 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 265) no Hoare annotation was computed. [2022-01-10 21:41:52,914 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 264) no Hoare annotation was computed. [2022-01-10 21:41:52,916 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:52,917 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:41:52,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:41:52 BasicIcfg [2022-01-10 21:41:52,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:41:52,951 INFO L158 Benchmark]: Toolchain (without parser) took 4032.82ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 116.5MB in the beginning and 62.9MB in the end (delta: 53.6MB). Peak memory consumption was 87.6MB. Max. memory is 8.0GB. [2022-01-10 21:41:52,951 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 167.8MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:41:52,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.41ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 116.2MB in the beginning and 174.3MB in the end (delta: -58.1MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2022-01-10 21:41:52,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.69ms. Allocated memory is still 201.3MB. Free memory was 174.3MB in the beginning and 170.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 21:41:52,952 INFO L158 Benchmark]: Boogie Preprocessor took 33.70ms. Allocated memory is still 201.3MB. Free memory was 170.7MB in the beginning and 168.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 21:41:52,952 INFO L158 Benchmark]: RCFGBuilder took 579.69ms. Allocated memory is still 201.3MB. Free memory was 168.6MB in the beginning and 139.7MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-01-10 21:41:52,952 INFO L158 Benchmark]: IcfgTransformer took 179.15ms. Allocated memory is still 201.3MB. Free memory was 139.7MB in the beginning and 125.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-10 21:41:52,952 INFO L158 Benchmark]: TraceAbstraction took 2867.48ms. Allocated memory is still 201.3MB. Free memory was 125.1MB in the beginning and 62.9MB in the end (delta: 62.2MB). Peak memory consumption was 63.3MB. Max. memory is 8.0GB. [2022-01-10 21:41:52,953 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 167.8MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 318.41ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 116.2MB in the beginning and 174.3MB in the end (delta: -58.1MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.69ms. Allocated memory is still 201.3MB. Free memory was 174.3MB in the beginning and 170.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.70ms. Allocated memory is still 201.3MB. Free memory was 170.7MB in the beginning and 168.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 579.69ms. Allocated memory is still 201.3MB. Free memory was 168.6MB in the beginning and 139.7MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * IcfgTransformer took 179.15ms. Allocated memory is still 201.3MB. Free memory was 139.7MB in the beginning and 125.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2867.48ms. Allocated memory is still 201.3MB. Free memory was 125.1MB in the beginning and 62.9MB in the end (delta: 62.2MB). Peak memory consumption was 63.3MB. 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: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 196 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 896 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 896 mSDsluCounter, 3408 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1300 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 452 IncrementalHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 2108 mSDtfsCounter, 452 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 107 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 125 NumberOfFragments, 965 HoareAnnotationTreeSize, 68 FomulaSimplifications, 120 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 68 FomulaSimplificationsInter, 685 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 458 ConstructedInterpolants, 0 QuantifiedInterpolants, 1051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 16 specifications checked. All of them hold - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, compRegistered) && setEventCalled == 1bv32) && ~bvule32(5bv32, MPR1)) && !(pended == 1bv32)) && NP == 1bv32) && s == MPR1 - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, compRegistered) && setEventCalled == 1bv32) && ~bvule32(5bv32, MPR1)) && !(pended == 1bv32)) && NP == 1bv32) && s == MPR1 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: UNLOADED == s || ((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((~bvule32(1bv32, compRegistered) && ~bvule32(5bv32, MPR1)) && NP == s) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~zero_extendFrom32To65(NP), ~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s)))) - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: (((~bvule32(1bv32, compRegistered) && ~bvule32(5bv32, MPR1)) && NP == s) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((~bvule32(5bv32, MPR1) && compRegistered == 0bv32) && NP == s) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, compRegistered) && setEventCalled == 1bv32) && ~bvule32(5bv32, MPR1)) && !(pended == 1bv32)) && NP == 1bv32) && s == MPR1 - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: (((((((((s == MPR3 && ~bvule32(1bv32, compRegistered)) && ~bvule32(259bv32, returnVal2)) && setEventCalled == 1bv32) && ~bvule32(returnVal2, 259bv32)) && ~bvule32(5bv32, MPR1)) && !(pended == 1bv32)) && ~bvule32(\result, 259bv32)) && ~bvule32(259bv32, \result)) && NP == 1bv32) || (((((~bvule32(1bv32, compRegistered) && setEventCalled == 1bv32) && ~bvule32(5bv32, MPR1)) && NP == s) && !(pended == 1bv32)) && NP == 1bv32) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: UNLOADED == s || ((~bvule32(5bv32, MPR1) && !(pended == 1bv32)) && NP == 1bv32) - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: ((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && ~bvule32(1bv32, compRegistered)) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((~bvule32(1bv32, compRegistered) && ~bvule32(returnVal2, 0bv32)) && setEventCalled == 1bv32) && ~bvule32(5bv32, MPR1)) && !(pended == 1bv32)) && NP == 1bv32) && s == MPR1) || ((((((~bvule32(3221225473bv32, returnVal2) && ~bvule32(1bv32, compRegistered)) && setEventCalled == 1bv32) && ~bvule32(5bv32, MPR1)) && !(pended == 1bv32)) && NP == 1bv32) && s == MPR1)) || (((((((~bvule32(1bv32, compRegistered) && ~bvule32(259bv32, returnVal2)) && setEventCalled == 1bv32) && ~bvule32(returnVal2, 259bv32)) && ~bvule32(5bv32, MPR1)) && !(pended == 1bv32)) && NP == 1bv32) && s == MPR1) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((~bvule32(5bv32, MPR1) && compRegistered == 0bv32) && NP == s) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((~bvule32(1bv32, compRegistered) && ~bvule32(5bv32, MPR1)) && NP == s) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, compRegistered) && setEventCalled == 1bv32) && ~bvule32(5bv32, MPR1)) && NP == s) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~zero_extendFrom32To65(NP), ~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s)))) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: ((~bvule32(5bv32, MPR1) && compRegistered == 0bv32) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: (~bvule32(5bv32, MPR1) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~zero_extendFrom32To65(NP), ~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s)))) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((~bvule32(5bv32, MPR1) && compRegistered == 0bv32) && NP == s) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, compRegistered) && setEventCalled == 1bv32) && ~bvule32(5bv32, MPR1)) && NP == s) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (~bvule32(5bv32, MPR1) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s))), ~zero_extendFrom32To65(SKIP1)) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((((~bvule32(1bv32, compRegistered) && setEventCalled == 1bv32) && ~bvule32(5bv32, MPR1)) && !(pended == 1bv32)) && NP == 1bv32) && s == MPR1 - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: ((~bvule32(5bv32, MPR1) && compRegistered == 0bv32) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: ((~bvule32(5bv32, MPR1) && compRegistered == 0bv32) && !(pended == 1bv32)) && NP == 1bv32 - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: UNLOADED == s || ((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && ~bvule32(1bv32, compRegistered)) && !(0bv65 == ~bvadd16(~zero_extendFrom32To65(MPR3), ~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s)))))) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && 0bv65 == ~bvadd16(~zero_extendFrom32To65(NP), ~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s)))) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((((!(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(pended))) && !(0bv65 == ~bvadd16(~zero_extendFrom32To65(MPR3), ~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(s)))))) && UNLOADED == s) && 0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(NP))) && ~bvule32(5bv32, MPR1)) && compRegistered == 0bv32) && ~bvule32(myStatus, 0bv32) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-01-10 21:41:53,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...