/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/seq-pthread/cs_lazy.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 19:12:33,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 19:12:33,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 19:12:34,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 19:12:34,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 19:12:34,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 19:12:34,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 19:12:34,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 19:12:34,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 19:12:34,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 19:12:34,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 19:12:34,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 19:12:34,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 19:12:34,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 19:12:34,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 19:12:34,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 19:12:34,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 19:12:34,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 19:12:34,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 19:12:34,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 19:12:34,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 19:12:34,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 19:12:34,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 19:12:34,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 19:12:34,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 19:12:34,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 19:12:34,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 19:12:34,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 19:12:34,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 19:12:34,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 19:12:34,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 19:12:34,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 19:12:34,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 19:12:34,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 19:12:34,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 19:12:34,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 19:12:34,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 19:12:34,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 19:12:34,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 19:12:34,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 19:12:34,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 19:12:34,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 19:12:34,097 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 19:12:34,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 19:12:34,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 19:12:34,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 19:12:34,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 19:12:34,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 19:12:34,099 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 19:12:34,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 19:12:34,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 19:12:34,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 19:12:34,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 19:12:34,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 19:12:34,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 19:12:34,100 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 19:12:34,100 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 19:12:34,100 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 19:12:34,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 19:12:34,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 19:12:34,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 19:12:34,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 19:12:34,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 19:12:34,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 19:12:34,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 19:12:34,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 19:12:34,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 19:12:34,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 19:12:34,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 19:12:34,102 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 19:12:34,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 19:12:34,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 19:12:34,102 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 19:12:34,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 19:12:34,103 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 19:12:34,103 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 19:12:34,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 19:12:34,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 19:12:34,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 19:12:34,323 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 19:12:34,324 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 19:12:34,324 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_lazy.i [2022-01-10 19:12:34,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44fc17590/af2d053b47f7430ea713c0133acb8d8d/FLAGe55fbda8a [2022-01-10 19:12:34,722 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 19:12:34,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_lazy.i [2022-01-10 19:12:34,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44fc17590/af2d053b47f7430ea713c0133acb8d8d/FLAGe55fbda8a [2022-01-10 19:12:35,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44fc17590/af2d053b47f7430ea713c0133acb8d8d [2022-01-10 19:12:35,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 19:12:35,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 19:12:35,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 19:12:35,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 19:12:35,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 19:12:35,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73dfa7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35, skipping insertion in model container [2022-01-10 19:12:35,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 19:12:35,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 19:12:35,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_lazy.i[23394,23407] [2022-01-10 19:12:35,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 19:12:35,456 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 19:12:35,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_lazy.i[23394,23407] [2022-01-10 19:12:35,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 19:12:35,534 INFO L208 MainTranslator]: Completed translation [2022-01-10 19:12:35,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35 WrapperNode [2022-01-10 19:12:35,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 19:12:35,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 19:12:35,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 19:12:35,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 19:12:35,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,619 INFO L137 Inliner]: procedures = 149, calls = 212, calls flagged for inlining = 48, calls inlined = 171, statements flattened = 3129 [2022-01-10 19:12:35,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 19:12:35,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 19:12:35,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 19:12:35,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 19:12:35,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 19:12:35,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 19:12:35,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 19:12:35,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 19:12:35,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (1/1) ... [2022-01-10 19:12:35,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 19:12:35,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 19:12:35,760 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 19:12:35,762 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 19:12:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-01-10 19:12:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 19:12:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 19:12:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 19:12:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 19:12:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 19:12:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-01-10 19:12:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 19:12:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 19:12:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 19:12:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 19:12:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-01-10 19:12:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 19:12:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 19:12:35,967 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 19:12:35,968 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 19:12:35,985 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 19:12:35,985 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 19:12:35,998 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 19:12:35,999 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 19:12:36,006 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 19:12:36,006 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 19:12:36,011 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 19:12:36,011 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 19:12:41,225 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##686: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,225 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,225 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##693: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,225 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##692: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,225 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,225 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,225 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-13: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,225 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-35: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,225 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-36: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-37: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-59: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-60: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-61: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-83: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-84: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-85: assume { :end_inline___CS_cs } true; [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-33: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-33: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-35: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,226 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-35: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-99: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-99: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-38: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-39: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-39: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-101: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-41: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##421: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##420: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##428: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-165: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-165: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-105: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-105: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-167: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-107: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-108: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-108: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-110: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-111: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-111: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-113: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-231: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-231: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-233: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-177: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-177: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-179: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-180: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-180: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-182: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-183: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-183: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-185: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-249: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-249: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-251: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-252: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-252: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-254: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-255: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-255: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-257: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-4: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-4: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-6: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-6: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-2: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-2: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-4: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-4: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-6: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-6: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-4: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-4: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 19:12:41,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-6: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-10 19:12:41,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-6: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 19:12:41,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##951: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##950: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##958: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##957: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##155: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##156: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 19:12:41,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 19:12:41,232 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 19:12:41,263 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 19:12:41,265 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 19:12:41,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:12:41 BoogieIcfgContainer [2022-01-10 19:12:41,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 19:12:41,267 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 19:12:41,267 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 19:12:41,268 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 19:12:41,270 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:12:41" (1/1) ... [2022-01-10 19:12:41,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 07:12:41 BasicIcfg [2022-01-10 19:12:41,627 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 19:12:41,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 19:12:41,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 19:12:41,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 19:12:41,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 07:12:35" (1/4) ... [2022-01-10 19:12:41,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a5dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 07:12:41, skipping insertion in model container [2022-01-10 19:12:41,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:35" (2/4) ... [2022-01-10 19:12:41,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a5dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 07:12:41, skipping insertion in model container [2022-01-10 19:12:41,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:12:41" (3/4) ... [2022-01-10 19:12:41,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a5dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 07:12:41, skipping insertion in model container [2022-01-10 19:12:41,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 07:12:41" (4/4) ... [2022-01-10 19:12:41,632 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_lazy.iTransformedIcfg [2022-01-10 19:12:41,635 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 19:12:41,636 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 19:12:41,667 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 19:12:41,671 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 19:12:41,671 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 19:12:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 771 states, 769 states have (on average 1.504551365409623) internal successors, (1157), 770 states have internal predecessors, (1157), 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 19:12:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 19:12:41,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:12:41,700 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 19:12:41,700 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:12:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:12:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash -25123560, now seen corresponding path program 1 times [2022-01-10 19:12:41,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:12:41,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330635426] [2022-01-10 19:12:41,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:12:41,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:12:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:12:41,929 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 19:12:41,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:12:41,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330635426] [2022-01-10 19:12:41,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330635426] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:12:41,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:12:41,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 19:12:41,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988082613] [2022-01-10 19:12:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:12:41,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 19:12:41,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:12:41,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 19:12:41,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 19:12:41,961 INFO L87 Difference]: Start difference. First operand has 771 states, 769 states have (on average 1.504551365409623) internal successors, (1157), 770 states have internal predecessors, (1157), 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 2 states, 2 states have (on average 17.0) internal successors, (34), 2 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 19:12:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:12:41,998 INFO L93 Difference]: Finished difference Result 1540 states and 2312 transitions. [2022-01-10 19:12:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 19:12:42,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 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 19:12:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:12:42,017 INFO L225 Difference]: With dead ends: 1540 [2022-01-10 19:12:42,017 INFO L226 Difference]: Without dead ends: 767 [2022-01-10 19:12:42,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 19:12:42,023 INFO L933 BasicCegarLoop]: 1048 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 19:12:42,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 19:12:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-01-10 19:12:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2022-01-10 19:12:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.3629242819843341) internal successors, (1044), 766 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 19:12:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1044 transitions. [2022-01-10 19:12:42,085 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1044 transitions. Word has length 34 [2022-01-10 19:12:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:12:42,085 INFO L470 AbstractCegarLoop]: Abstraction has 767 states and 1044 transitions. [2022-01-10 19:12:42,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 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 19:12:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1044 transitions. [2022-01-10 19:12:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 19:12:42,087 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:12:42,087 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 19:12:42,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 19:12:42,088 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:12:42,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:12:42,088 INFO L85 PathProgramCache]: Analyzing trace with hash -496267283, now seen corresponding path program 1 times [2022-01-10 19:12:42,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:12:42,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604745126] [2022-01-10 19:12:42,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:12:42,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:12:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:12:42,632 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 19:12:42,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:12:42,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604745126] [2022-01-10 19:12:42,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604745126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:12:42,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:12:42,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 19:12:42,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477039442] [2022-01-10 19:12:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:12:42,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 19:12:42,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:12:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 19:12:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 19:12:42,635 INFO L87 Difference]: Start difference. First operand 767 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 8.5) 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 19:12:42,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:12:42,814 INFO L93 Difference]: Finished difference Result 1404 states and 1908 transitions. [2022-01-10 19:12:42,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 19:12:42,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) 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 19:12:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:12:42,820 INFO L225 Difference]: With dead ends: 1404 [2022-01-10 19:12:42,820 INFO L226 Difference]: Without dead ends: 1343 [2022-01-10 19:12:42,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:12:42,822 INFO L933 BasicCegarLoop]: 1330 mSDtfsCounter, 971 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 3488 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 19:12:42,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [971 Valid, 3488 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 19:12:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-01-10 19:12:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1340. [2022-01-10 19:12:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 1.3539955190440627) internal successors, (1813), 1339 states have internal predecessors, (1813), 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 19:12:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1813 transitions. [2022-01-10 19:12:42,844 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1813 transitions. Word has length 34 [2022-01-10 19:12:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:12:42,845 INFO L470 AbstractCegarLoop]: Abstraction has 1340 states and 1813 transitions. [2022-01-10 19:12:42,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) 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 19:12:42,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1813 transitions. [2022-01-10 19:12:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 19:12:42,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:12:42,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 19:12:42,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 19:12:42,850 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:12:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:12:42,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2138829916, now seen corresponding path program 1 times [2022-01-10 19:12:42,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:12:42,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453560446] [2022-01-10 19:12:42,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:12:42,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:12:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:12:43,287 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 19:12:43,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:12:43,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453560446] [2022-01-10 19:12:43,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453560446] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:12:43,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:12:43,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 19:12:43,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857865459] [2022-01-10 19:12:43,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:12:43,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 19:12:43,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:12:43,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 19:12:43,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 19:12:43,289 INFO L87 Difference]: Start difference. First operand 1340 states and 1813 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 19:12:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:12:44,391 INFO L93 Difference]: Finished difference Result 3721 states and 5015 transitions. [2022-01-10 19:12:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 19:12:44,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-01-10 19:12:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:12:44,402 INFO L225 Difference]: With dead ends: 3721 [2022-01-10 19:12:44,402 INFO L226 Difference]: Without dead ends: 2580 [2022-01-10 19:12:44,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 19:12:44,410 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 2370 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 19:12:44,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2370 Valid, 2397 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 19:12:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-01-10 19:12:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 1293. [2022-01-10 19:12:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1292 states have (on average 1.3544891640866874) internal successors, (1750), 1292 states have internal predecessors, (1750), 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 19:12:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1750 transitions. [2022-01-10 19:12:44,448 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1750 transitions. Word has length 62 [2022-01-10 19:12:44,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:12:44,448 INFO L470 AbstractCegarLoop]: Abstraction has 1293 states and 1750 transitions. [2022-01-10 19:12:44,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 19:12:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1750 transitions. [2022-01-10 19:12:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 19:12:44,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:12:44,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 19:12:44,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 19:12:44,450 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:12:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:12:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash -444156981, now seen corresponding path program 1 times [2022-01-10 19:12:44,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:12:44,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598496595] [2022-01-10 19:12:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:12:44,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:12:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:12:44,817 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 19:12:44,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:12:44,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598496595] [2022-01-10 19:12:44,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598496595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:12:44,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:12:44,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 19:12:44,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503382674] [2022-01-10 19:12:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:12:44,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 19:12:44,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:12:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 19:12:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 19:12:44,819 INFO L87 Difference]: Start difference. First operand 1293 states and 1750 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 19:12:46,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 19:12:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:12:48,194 INFO L93 Difference]: Finished difference Result 3407 states and 4590 transitions. [2022-01-10 19:12:48,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 19:12:48,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2022-01-10 19:12:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:12:48,205 INFO L225 Difference]: With dead ends: 3407 [2022-01-10 19:12:48,206 INFO L226 Difference]: Without dead ends: 2603 [2022-01-10 19:12:48,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:12:48,208 INFO L933 BasicCegarLoop]: 1073 mSDtfsCounter, 1260 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-10 19:12:48,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1260 Valid, 2992 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-01-10 19:12:48,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2022-01-10 19:12:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1404. [2022-01-10 19:12:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 1.3592302209550962) internal successors, (1907), 1403 states have internal predecessors, (1907), 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 19:12:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1907 transitions. [2022-01-10 19:12:48,247 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1907 transitions. Word has length 62 [2022-01-10 19:12:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:12:48,247 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 1907 transitions. [2022-01-10 19:12:48,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 19:12:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1907 transitions. [2022-01-10 19:12:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 19:12:48,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:12:48,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 19:12:48,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 19:12:48,250 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:12:48,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:12:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1341211864, now seen corresponding path program 1 times [2022-01-10 19:12:48,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:12:48,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952043091] [2022-01-10 19:12:48,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:12:48,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:12:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:12:48,480 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 19:12:48,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:12:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952043091] [2022-01-10 19:12:48,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952043091] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:12:48,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:12:48,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 19:12:48,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208396665] [2022-01-10 19:12:48,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:12:48,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 19:12:48,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:12:48,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 19:12:48,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 19:12:48,482 INFO L87 Difference]: Start difference. First operand 1404 states and 1907 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 19:12:50,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 19:12:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:12:51,890 INFO L93 Difference]: Finished difference Result 2955 states and 3968 transitions. [2022-01-10 19:12:51,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 19:12:51,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2022-01-10 19:12:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:12:51,898 INFO L225 Difference]: With dead ends: 2955 [2022-01-10 19:12:51,899 INFO L226 Difference]: Without dead ends: 2518 [2022-01-10 19:12:51,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:12:51,900 INFO L933 BasicCegarLoop]: 1071 mSDtfsCounter, 1201 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-10 19:12:51,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1201 Valid, 2988 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-01-10 19:12:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2022-01-10 19:12:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 1694. [2022-01-10 19:12:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1693 states have (on average 1.362669816893089) internal successors, (2307), 1693 states have internal predecessors, (2307), 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 19:12:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2307 transitions. [2022-01-10 19:12:51,942 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2307 transitions. Word has length 62 [2022-01-10 19:12:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:12:51,944 INFO L470 AbstractCegarLoop]: Abstraction has 1694 states and 2307 transitions. [2022-01-10 19:12:51,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 19:12:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2307 transitions. [2022-01-10 19:12:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 19:12:51,947 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:12:51,947 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 19:12:51,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 19:12:51,947 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:12:51,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:12:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash -221770809, now seen corresponding path program 1 times [2022-01-10 19:12:51,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:12:51,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596779339] [2022-01-10 19:12:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:12:51,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:12:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:12:52,230 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 19:12:52,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:12:52,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596779339] [2022-01-10 19:12:52,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596779339] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:12:52,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:12:52,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 19:12:52,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543720794] [2022-01-10 19:12:52,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:12:52,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 19:12:52,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:12:52,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 19:12:52,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 19:12:52,233 INFO L87 Difference]: Start difference. First operand 1694 states and 2307 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 19:12:54,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 19:12:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:12:55,493 INFO L93 Difference]: Finished difference Result 2524 states and 3390 transitions. [2022-01-10 19:12:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 19:12:55,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2022-01-10 19:12:55,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:12:55,509 INFO L225 Difference]: With dead ends: 2524 [2022-01-10 19:12:55,509 INFO L226 Difference]: Without dead ends: 2428 [2022-01-10 19:12:55,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:12:55,516 INFO L933 BasicCegarLoop]: 1069 mSDtfsCounter, 1066 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 2907 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-01-10 19:12:55,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1066 Valid, 2907 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-01-10 19:12:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2022-01-10 19:12:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 1984. [2022-01-10 19:12:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1983 states have (on average 1.3645990922844176) internal successors, (2706), 1983 states have internal predecessors, (2706), 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 19:12:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2706 transitions. [2022-01-10 19:12:55,562 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2706 transitions. Word has length 62 [2022-01-10 19:12:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:12:55,563 INFO L470 AbstractCegarLoop]: Abstraction has 1984 states and 2706 transitions. [2022-01-10 19:12:55,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 19:12:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2706 transitions. [2022-01-10 19:12:55,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 19:12:55,566 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:12:55,566 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 19:12:55,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 19:12:55,566 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:12:55,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:12:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1734215574, now seen corresponding path program 1 times [2022-01-10 19:12:55,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:12:55,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723980503] [2022-01-10 19:12:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:12:55,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:12:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:12:55,911 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 19:12:55,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:12:55,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723980503] [2022-01-10 19:12:55,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723980503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:12:55,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:12:55,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 19:12:55,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513929523] [2022-01-10 19:12:55,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:12:55,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 19:12:55,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:12:55,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 19:12:55,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 19:12:55,913 INFO L87 Difference]: Start difference. First operand 1984 states and 2706 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 19:12:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:12:56,840 INFO L93 Difference]: Finished difference Result 3804 states and 5144 transitions. [2022-01-10 19:12:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 19:12:56,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2022-01-10 19:12:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:12:56,849 INFO L225 Difference]: With dead ends: 3804 [2022-01-10 19:12:56,850 INFO L226 Difference]: Without dead ends: 2319 [2022-01-10 19:12:56,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 19:12:56,852 INFO L933 BasicCegarLoop]: 1016 mSDtfsCounter, 2152 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 19:12:56,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2152 Valid, 2333 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 19:12:56,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2022-01-10 19:12:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1946. [2022-01-10 19:12:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1945 states have (on average 1.365038560411311) internal successors, (2655), 1945 states have internal predecessors, (2655), 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 19:12:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2655 transitions. [2022-01-10 19:12:56,894 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2655 transitions. Word has length 69 [2022-01-10 19:12:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:12:56,894 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 2655 transitions. [2022-01-10 19:12:56,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 19:12:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2655 transitions. [2022-01-10 19:12:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 19:12:56,896 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:12:56,897 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 19:12:56,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 19:12:56,897 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:12:56,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:12:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash 466381726, now seen corresponding path program 1 times [2022-01-10 19:12:56,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:12:56,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230075549] [2022-01-10 19:12:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:12:56,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:12:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:12:57,144 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 19:12:57,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:12:57,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230075549] [2022-01-10 19:12:57,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230075549] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:12:57,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:12:57,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 19:12:57,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197168544] [2022-01-10 19:12:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:12:57,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 19:12:57,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:12:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 19:12:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 19:12:57,146 INFO L87 Difference]: Start difference. First operand 1946 states and 2655 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 19:12:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:12:58,911 INFO L93 Difference]: Finished difference Result 5022 states and 6714 transitions. [2022-01-10 19:12:58,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 19:12:58,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2022-01-10 19:12:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:12:58,934 INFO L225 Difference]: With dead ends: 5022 [2022-01-10 19:12:58,934 INFO L226 Difference]: Without dead ends: 3044 [2022-01-10 19:12:58,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 19:12:58,937 INFO L933 BasicCegarLoop]: 743 mSDtfsCounter, 1509 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 19:12:58,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1509 Valid, 1832 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 19:12:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2022-01-10 19:12:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2528. [2022-01-10 19:12:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2527 states have (on average 1.2742382271468145) internal successors, (3220), 2527 states have internal predecessors, (3220), 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 19:12:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3220 transitions. [2022-01-10 19:12:59,042 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3220 transitions. Word has length 69 [2022-01-10 19:12:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:12:59,043 INFO L470 AbstractCegarLoop]: Abstraction has 2528 states and 3220 transitions. [2022-01-10 19:12:59,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 19:12:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3220 transitions. [2022-01-10 19:12:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 19:12:59,047 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:12:59,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 19:12:59,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 19:12:59,048 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:12:59,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:12:59,049 INFO L85 PathProgramCache]: Analyzing trace with hash 179181729, now seen corresponding path program 1 times [2022-01-10 19:12:59,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:12:59,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089411336] [2022-01-10 19:12:59,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:12:59,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:12:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:12:59,465 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 19:12:59,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:12:59,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089411336] [2022-01-10 19:12:59,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089411336] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:12:59,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:12:59,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 19:12:59,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682321312] [2022-01-10 19:12:59,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:12:59,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 19:12:59,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:12:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 19:12:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 19:12:59,468 INFO L87 Difference]: Start difference. First operand 2528 states and 3220 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 19:13:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:13:01,893 INFO L93 Difference]: Finished difference Result 5571 states and 7054 transitions. [2022-01-10 19:13:01,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 19:13:01,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2022-01-10 19:13:01,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:13:01,923 INFO L225 Difference]: With dead ends: 5571 [2022-01-10 19:13:01,923 INFO L226 Difference]: Without dead ends: 3189 [2022-01-10 19:13:01,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 19:13:01,928 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 1359 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 2449 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-10 19:13:01,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1359 Valid, 2449 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-10 19:13:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2022-01-10 19:13:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2772. [2022-01-10 19:13:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2771 states have (on average 1.270299530855287) internal successors, (3520), 2771 states have internal predecessors, (3520), 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 19:13:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3520 transitions. [2022-01-10 19:13:01,993 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3520 transitions. Word has length 69 [2022-01-10 19:13:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:13:01,994 INFO L470 AbstractCegarLoop]: Abstraction has 2772 states and 3520 transitions. [2022-01-10 19:13:01,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 19:13:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3520 transitions. [2022-01-10 19:13:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 19:13:02,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:13:02,003 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 19:13:02,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 19:13:02,004 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:13:02,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:13:02,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1465315903, now seen corresponding path program 1 times [2022-01-10 19:13:02,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:13:02,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180206832] [2022-01-10 19:13:02,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:13:02,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:13:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:13:02,245 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 19:13:02,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:13:02,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180206832] [2022-01-10 19:13:02,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180206832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:13:02,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:13:02,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 19:13:02,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176124551] [2022-01-10 19:13:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:13:02,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 19:13:02,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:13:02,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 19:13:02,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 19:13:02,247 INFO L87 Difference]: Start difference. First operand 2772 states and 3520 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 19:13:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:13:03,484 INFO L93 Difference]: Finished difference Result 5253 states and 6629 transitions. [2022-01-10 19:13:03,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 19:13:03,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-01-10 19:13:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:13:03,501 INFO L225 Difference]: With dead ends: 5253 [2022-01-10 19:13:03,501 INFO L226 Difference]: Without dead ends: 3154 [2022-01-10 19:13:03,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 19:13:03,505 INFO L933 BasicCegarLoop]: 1000 mSDtfsCounter, 1582 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 19:13:03,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1582 Valid, 2317 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 19:13:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2022-01-10 19:13:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 2713. [2022-01-10 19:13:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 2712 states have (on average 1.2710176991150441) internal successors, (3447), 2712 states have internal predecessors, (3447), 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 19:13:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 3447 transitions. [2022-01-10 19:13:03,606 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 3447 transitions. Word has length 70 [2022-01-10 19:13:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:13:03,607 INFO L470 AbstractCegarLoop]: Abstraction has 2713 states and 3447 transitions. [2022-01-10 19:13:03,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 19:13:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3447 transitions. [2022-01-10 19:13:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 19:13:03,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:13:03,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 19:13:03,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 19:13:03,612 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:13:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:13:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash -210681262, now seen corresponding path program 1 times [2022-01-10 19:13:03,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:13:03,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232547096] [2022-01-10 19:13:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:13:03,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:13:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:13:04,137 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 19:13:04,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:13:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232547096] [2022-01-10 19:13:04,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232547096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:13:04,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:13:04,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 19:13:04,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449611741] [2022-01-10 19:13:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:13:04,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 19:13:04,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:13:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 19:13:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 19:13:04,139 INFO L87 Difference]: Start difference. First operand 2713 states and 3447 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 19:13:04,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:13:04,264 INFO L93 Difference]: Finished difference Result 5424 states and 6892 transitions. [2022-01-10 19:13:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 19:13:04,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-01-10 19:13:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:13:04,286 INFO L225 Difference]: With dead ends: 5424 [2022-01-10 19:13:04,287 INFO L226 Difference]: Without dead ends: 2718 [2022-01-10 19:13:04,290 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 19:13:04,290 INFO L933 BasicCegarLoop]: 903 mSDtfsCounter, 5 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 19:13:04,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1804 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 19:13:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2022-01-10 19:13:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2714. [2022-01-10 19:13:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2713 states have (on average 1.2709178031699226) internal successors, (3448), 2713 states have internal predecessors, (3448), 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 19:13:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3448 transitions. [2022-01-10 19:13:04,355 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3448 transitions. Word has length 70 [2022-01-10 19:13:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:13:04,355 INFO L470 AbstractCegarLoop]: Abstraction has 2714 states and 3448 transitions. [2022-01-10 19:13:04,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 19:13:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3448 transitions. [2022-01-10 19:13:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 19:13:04,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:13:04,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:04,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 19:13:04,359 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:13:04,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:13:04,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1791385914, now seen corresponding path program 1 times [2022-01-10 19:13:04,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:13:04,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974496895] [2022-01-10 19:13:04,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:13:04,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:13:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:13:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 19:13:04,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:13:04,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974496895] [2022-01-10 19:13:04,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974496895] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:13:04,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:13:04,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 19:13:04,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90759500] [2022-01-10 19:13:04,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:13:04,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 19:13:04,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:13:04,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 19:13:04,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 19:13:04,781 INFO L87 Difference]: Start difference. First operand 2714 states and 3448 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 19:13:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:13:04,850 INFO L93 Difference]: Finished difference Result 5427 states and 6896 transitions. [2022-01-10 19:13:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 19:13:04,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2022-01-10 19:13:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:13:04,855 INFO L225 Difference]: With dead ends: 5427 [2022-01-10 19:13:04,855 INFO L226 Difference]: Without dead ends: 2716 [2022-01-10 19:13:04,858 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 19:13:04,859 INFO L933 BasicCegarLoop]: 905 mSDtfsCounter, 1 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 19:13:04,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 1807 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 19:13:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2022-01-10 19:13:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2715. [2022-01-10 19:13:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.2708179808400883) internal successors, (3449), 2714 states have internal predecessors, (3449), 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 19:13:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3449 transitions. [2022-01-10 19:13:04,922 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3449 transitions. Word has length 74 [2022-01-10 19:13:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:13:04,922 INFO L470 AbstractCegarLoop]: Abstraction has 2715 states and 3449 transitions. [2022-01-10 19:13:04,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 19:13:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3449 transitions. [2022-01-10 19:13:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-10 19:13:04,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:13:04,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:04,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 19:13:04,925 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:13:04,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:13:04,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1771860886, now seen corresponding path program 1 times [2022-01-10 19:13:04,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:13:04,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824715264] [2022-01-10 19:13:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:13:04,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:13:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:13:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 19:13:05,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:13:05,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824715264] [2022-01-10 19:13:05,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824715264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:13:05,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:13:05,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 19:13:05,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377769433] [2022-01-10 19:13:05,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:13:05,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 19:13:05,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:13:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 19:13:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 19:13:05,654 INFO L87 Difference]: Start difference. First operand 2715 states and 3449 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 19:13:07,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 19:13:09,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 19:13:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:13:10,802 INFO L93 Difference]: Finished difference Result 4570 states and 5794 transitions. [2022-01-10 19:13:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 19:13:10,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2022-01-10 19:13:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:13:10,806 INFO L225 Difference]: With dead ends: 4570 [2022-01-10 19:13:10,806 INFO L226 Difference]: Without dead ends: 2715 [2022-01-10 19:13:10,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 19:13:10,810 INFO L933 BasicCegarLoop]: 905 mSDtfsCounter, 0 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-01-10 19:13:10,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1672 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-01-10 19:13:10,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2022-01-10 19:13:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2715. [2022-01-10 19:13:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.2704495210022109) internal successors, (3448), 2714 states have internal predecessors, (3448), 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 19:13:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3448 transitions. [2022-01-10 19:13:10,867 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3448 transitions. Word has length 76 [2022-01-10 19:13:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:13:10,867 INFO L470 AbstractCegarLoop]: Abstraction has 2715 states and 3448 transitions. [2022-01-10 19:13:10,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 19:13:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3448 transitions. [2022-01-10 19:13:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-10 19:13:10,870 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:13:10,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:10,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 19:13:10,871 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:13:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:13:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1982339350, now seen corresponding path program 1 times [2022-01-10 19:13:10,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:13:10,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420865693] [2022-01-10 19:13:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:13:10,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:13:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:13:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 19:13:11,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:13:11,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420865693] [2022-01-10 19:13:11,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420865693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 19:13:11,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 19:13:11,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 19:13:11,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34858516] [2022-01-10 19:13:11,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 19:13:11,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 19:13:11,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:13:11,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 19:13:11,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 19:13:11,939 INFO L87 Difference]: Start difference. First operand 2715 states and 3448 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 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 19:13:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 19:13:14,385 INFO L93 Difference]: Finished difference Result 5614 states and 7077 transitions. [2022-01-10 19:13:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 19:13:14,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2022-01-10 19:13:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 19:13:14,390 INFO L225 Difference]: With dead ends: 5614 [2022-01-10 19:13:14,390 INFO L226 Difference]: Without dead ends: 3231 [2022-01-10 19:13:14,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-10 19:13:14,393 INFO L933 BasicCegarLoop]: 643 mSDtfsCounter, 1996 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-10 19:13:14,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1996 Valid, 1788 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-10 19:13:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2022-01-10 19:13:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3014. [2022-01-10 19:13:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 3013 states have (on average 1.264852306671092) internal successors, (3811), 3013 states have internal predecessors, (3811), 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 19:13:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 3811 transitions. [2022-01-10 19:13:14,487 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 3811 transitions. Word has length 87 [2022-01-10 19:13:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 19:13:14,487 INFO L470 AbstractCegarLoop]: Abstraction has 3014 states and 3811 transitions. [2022-01-10 19:13:14,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 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 19:13:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 3811 transitions. [2022-01-10 19:13:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-10 19:13:14,491 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 19:13:14,491 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:14,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 19:13:14,491 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 19:13:14,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 19:13:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash -455575960, now seen corresponding path program 1 times [2022-01-10 19:13:14,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 19:13:14,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198073985] [2022-01-10 19:13:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:13:14,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 19:13:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:13:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 19:13:15,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 19:13:15,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198073985] [2022-01-10 19:13:15,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198073985] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 19:13:15,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053301362] [2022-01-10 19:13:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 19:13:15,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 19:13:15,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 19:13:15,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 19:13:15,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 19:13:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 19:13:22,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-10 19:13:22,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 19:13:22,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 19:13:22,504 INFO L353 Elim1Store]: treesize reduction 116, result has 44.5 percent of original size [2022-01-10 19:13:22,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 29 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 26 case distinctions, treesize of input 89 treesize of output 155 [2022-01-10 19:13:22,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 19:13:23,350 INFO L353 Elim1Store]: treesize reduction 60, result has 42.9 percent of original size [2022-01-10 19:13:23,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 90 [2022-01-10 19:13:23,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-01-10 19:13:23,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-01-10 19:13:23,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-01-10 19:13:23,696 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 19:13:23,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-01-10 19:13:23,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-10 19:13:23,851 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 19:13:23,852 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-01-10 19:13:23,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 19:13:23,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 19:13:23,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-01-10 19:13:23,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 19:13:24,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 19:13:24,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 19:13:24,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 19:13:24,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 19:13:24,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-01-10 19:13:24,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 19:13:24,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 19:13:24,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-10 19:13:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 19:13:24,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 19:13:24,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5825 Int) (v_ArrVal_5831 (Array Int Int)) (v_ArrVal_5832 (Array Int Int)) (v_ArrVal_5826 (Array Int Int)) (v_ArrVal_5836 (Array Int Int)) (v_ArrVal_5828 (Array Int Int)) (v_ArrVal_5838 (Array Int Int))) (not (= (mod (div (select (store (select (store (store (store (store (store (store |c_#memory_intInt| |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5838) |c_~#__CS_thread_lockedon~0.baseInt| v_ArrVal_5831) |c_~#mutex~0.baseInt| v_ArrVal_5836) |c_~#data~0.baseInt| v_ArrVal_5832) |c_~#__CS_thread_born_round~0.baseInt| v_ArrVal_5828) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5826) |c_~#__CS_thread_allocated~0.baseInt|) |c_~#__CS_thread_allocated~0.offsetInt| v_ArrVal_5825) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 1) 256) 1))) is different from false [2022-01-10 19:13:24,633 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5825 Int) (v_ArrVal_5831 (Array Int Int)) (v_ArrVal_5820 Int) (v_ArrVal_5822 (Array Int Int)) (v_ArrVal_5832 (Array Int Int)) (v_ArrVal_5823 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| Int) (v_ArrVal_5826 (Array Int Int)) (v_ArrVal_5836 (Array Int Int)) (v_ArrVal_5828 (Array Int Int)) (v_ArrVal_5838 (Array Int Int))) (not (= (mod (div (select (store (select (store (store (store (store (store (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5822) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5823) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt| (mod (+ (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4) (* 18446744056529682432 (mod (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) 2))) 18446744073709551616)) 18446744073709551616) v_ArrVal_5820)) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5838) |c_~#__CS_thread_lockedon~0.baseInt| v_ArrVal_5831) |c_~#mutex~0.baseInt| v_ArrVal_5836) |c_~#data~0.baseInt| v_ArrVal_5832) |c_~#__CS_thread_born_round~0.baseInt| v_ArrVal_5828) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5826) |c_~#__CS_thread_allocated~0.baseInt|) |c_~#__CS_thread_allocated~0.offsetInt| v_ArrVal_5825) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 1) 256) 1))) is different from false [2022-01-10 19:13:24,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5819 (Array Int Int)) (v_ArrVal_5818 (Array Int Int)) (v_ArrVal_5825 Int) (v_ArrVal_5820 Int) (v_ArrVal_5831 (Array Int Int)) (v_ArrVal_5822 (Array Int Int)) (v_ArrVal_5832 (Array Int Int)) (v_ArrVal_5823 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| Int) (v_ArrVal_5826 (Array Int Int)) (v_ArrVal_5836 (Array Int Int)) (v_ArrVal_5828 (Array Int Int)) (v_ArrVal_5838 (Array Int Int))) (not (= (mod (div (select (store (select (store (store (store (store (store (store (let ((.cse0 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| v_ArrVal_5819) |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt| v_ArrVal_5818))) (store (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5822) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| (store (select (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5823) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt| (mod (+ (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4) (* 18446744056529682432 (mod (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) 2))) 18446744073709551616)) 18446744073709551616) v_ArrVal_5820))) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5838) |c_~#__CS_thread_lockedon~0.baseInt| v_ArrVal_5831) |c_~#mutex~0.baseInt| v_ArrVal_5836) |c_~#data~0.baseInt| v_ArrVal_5832) |c_~#__CS_thread_born_round~0.baseInt| v_ArrVal_5828) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5826) |c_~#__CS_thread_allocated~0.baseInt|) |c_~#__CS_thread_allocated~0.offsetInt| v_ArrVal_5825) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 1) 256) 1))) is different from false [2022-01-10 19:13:25,157 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5819 (Array Int Int)) (v_ArrVal_5818 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt_1| Int) (v_ArrVal_5825 Int) (v_ArrVal_5820 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt_1| Int) (v_ArrVal_5831 (Array Int Int)) (v_ArrVal_5822 (Array Int Int)) (v_ArrVal_5832 (Array Int Int)) (v_ArrVal_5823 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| Int) (v_ArrVal_5826 (Array Int Int)) (v_ArrVal_5836 (Array Int Int)) (v_ArrVal_5828 (Array Int Int)) (v_ArrVal_5838 (Array Int Int))) (let ((.cse2 (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt_1| 1))) (let ((.cse0 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt_1|)) (.cse1 (select .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt_1|))) (or (not (<= 0 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt_1|)) (not (<= .cse0 0)) (not (<= (mod .cse1 2) 0)) (not (= (select (store .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt_1| 1) |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt_1|) 0)) (not (< |c_#StackHeapBarrierInt| |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt_1|)) (not (= (mod (div (select (store (select (store (store (store (store (store (store (let ((.cse3 (store (store |c_#memory_intInt| |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt_1| v_ArrVal_5819) |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt_1| v_ArrVal_5818))) (store (store .cse3 |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt_1| v_ArrVal_5822) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| (store (select (store .cse3 |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt_1| v_ArrVal_5823) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt|) (mod |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt_1| 18446744073709551616) v_ArrVal_5820))) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5838) |c_~#__CS_thread_lockedon~0.baseInt| v_ArrVal_5831) |c_~#mutex~0.baseInt| v_ArrVal_5836) |c_~#data~0.baseInt| v_ArrVal_5832) |c_~#__CS_thread_born_round~0.baseInt| v_ArrVal_5828) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5826) |c_~#__CS_thread_allocated~0.baseInt|) |c_~#__CS_thread_allocated~0.offsetInt| v_ArrVal_5825) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 1) 256) 1)) (not (< .cse1 2)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt_1| 0)))))) is different from false [2022-01-10 19:13:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 19:13:25,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053301362] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 19:13:25,162 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 19:13:25,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 10] total 19 [2022-01-10 19:13:25,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163153961] [2022-01-10 19:13:25,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 19:13:25,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 19:13:25,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 19:13:25,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 19:13:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=172, Unknown=4, NotChecked=116, Total=342 [2022-01-10 19:13:25,164 INFO L87 Difference]: Start difference. First operand 3014 states and 3811 transitions. Second operand has 19 states, 19 states have (on average 7.578947368421052) internal successors, (144), 19 states have internal predecessors, (144), 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 19:13:25,230 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#validInt| 6) 1) (not (= 6 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| 3)) (< 1 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt|) (not (= 3 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (= |c_~#__CS_thread_allocated~0.offsetInt| 0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt| 0) (= 4 |c_~#__CS_thread_born_round~0.baseInt|) (= |c_~#data~0.baseInt| 8) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 8)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt| 1)) (= (select (select |c_#memory_intInt| |c_~#__CS_thread_allocated~0.baseInt|) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 0) (not (= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt|)) (= (select |c_#validInt| 5) 1) (< 0 |c_#StackHeapBarrierInt|) (not (= 4 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (not (= 7 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (not (= 5 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt|) (not (= 7 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt|)) (= 5 |c_~#__CS_thread_status~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 4)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 1)) (= 1 (select |c_#validInt| 3)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 3)) (= (select |c_#validInt| 7) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 6)) (= 3 |c_~#__CS_thread_allocated~0.baseInt|) (= (select |c_#validInt| 2) 1) (= 6 |c_~#__CS_thread_lockedon~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| 8)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 5)) (forall ((v_ArrVal_5819 (Array Int Int)) (v_ArrVal_5818 (Array Int Int)) (v_ArrVal_5825 Int) (v_ArrVal_5820 Int) (v_ArrVal_5831 (Array Int Int)) (v_ArrVal_5822 (Array Int Int)) (v_ArrVal_5832 (Array Int Int)) (v_ArrVal_5823 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| Int) (v_ArrVal_5826 (Array Int Int)) (v_ArrVal_5836 (Array Int Int)) (v_ArrVal_5828 (Array Int Int)) (v_ArrVal_5838 (Array Int Int))) (not (= (mod (div (select (store (select (store (store (store (store (store (store (let ((.cse0 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| v_ArrVal_5819) |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt| v_ArrVal_5818))) (store (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5822) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| (store (select (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5823) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt| (mod (+ (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4) (* 18446744056529682432 (mod (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) 2))) 18446744073709551616)) 18446744073709551616) v_ArrVal_5820))) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5838) |c_~#__CS_thread_lockedon~0.baseInt| v_ArrVal_5831) |c_~#mutex~0.baseInt| v_ArrVal_5836) |c_~#data~0.baseInt| v_ArrVal_5832) |c_~#__CS_thread_born_round~0.baseInt| v_ArrVal_5828) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5826) |c_~#__CS_thread_allocated~0.baseInt|) |c_~#__CS_thread_allocated~0.offsetInt| v_ArrVal_5825) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 1) 256) 1))) (not (= 8 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (= 7 |c_~#mutex~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| 4)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 2)) (= (select |c_#validInt| 1) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| 6)) (= (select |c_#validInt| 4) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) (= (select |c_#validInt| 8) 1) (not (= 7 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt|)) (not (= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (not (= 5 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt|))) is different from false [2022-01-10 19:13:25,241 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 6 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| 3)) (< 1 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt|) (not (= 3 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (= |c_~#__CS_thread_allocated~0.offsetInt| 0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt| 0) (= 4 |c_~#__CS_thread_born_round~0.baseInt|) (= |c_~#data~0.baseInt| 8) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 8)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt| 1)) (= (select (select |c_#memory_intInt| |c_~#__CS_thread_allocated~0.baseInt|) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 0) (not (= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt|)) (not (= 4 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (not (= 7 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (not (= 5 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt|) (not (= 7 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt|)) (= 5 |c_~#__CS_thread_status~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 4)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~j~2#1Int|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 1)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 3)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 6)) (= 3 |c_~#__CS_thread_allocated~0.baseInt|) (= 6 |c_~#__CS_thread_lockedon~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| 8)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 5)) (forall ((v_ArrVal_5819 (Array Int Int)) (v_ArrVal_5818 (Array Int Int)) (v_ArrVal_5825 Int) (v_ArrVal_5820 Int) (v_ArrVal_5831 (Array Int Int)) (v_ArrVal_5822 (Array Int Int)) (v_ArrVal_5832 (Array Int Int)) (v_ArrVal_5823 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| Int) (v_ArrVal_5826 (Array Int Int)) (v_ArrVal_5836 (Array Int Int)) (v_ArrVal_5828 (Array Int Int)) (v_ArrVal_5838 (Array Int Int))) (not (= (mod (div (select (store (select (store (store (store (store (store (store (let ((.cse0 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| v_ArrVal_5819) |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt| v_ArrVal_5818))) (store (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5822) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| (store (select (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5823) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt| (mod (+ (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4) (* 18446744056529682432 (mod (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) 2))) 18446744073709551616)) 18446744073709551616) v_ArrVal_5820))) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5838) |c_~#__CS_thread_lockedon~0.baseInt| v_ArrVal_5831) |c_~#mutex~0.baseInt| v_ArrVal_5836) |c_~#data~0.baseInt| v_ArrVal_5832) |c_~#__CS_thread_born_round~0.baseInt| v_ArrVal_5828) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5826) |c_~#__CS_thread_allocated~0.baseInt|) |c_~#__CS_thread_allocated~0.offsetInt| v_ArrVal_5825) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 1) 256) 1))) (not (= 8 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (= 7 |c_~#mutex~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| 4)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 2)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~j~2#1Int| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| 6)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) (not (= 7 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt|)) (not (= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.baseInt|)) (not (= 5 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.baseInt|))) is different from false [2022-01-10 19:13:25,251 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#__CS_thread_allocated~0.offsetInt| 0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt| 0) (= 4 |c_~#__CS_thread_born_round~0.baseInt|) (= |c_~#data~0.baseInt| 8) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 8)) (= (select (select |c_#memory_intInt| |c_~#__CS_thread_allocated~0.baseInt|) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt|) (= 5 |c_~#__CS_thread_status~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 4)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~j~2#1Int|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 1)) (forall ((v_ArrVal_5825 Int) (v_ArrVal_5831 (Array Int Int)) (v_ArrVal_5820 Int) (v_ArrVal_5822 (Array Int Int)) (v_ArrVal_5832 (Array Int Int)) (v_ArrVal_5823 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| Int) (v_ArrVal_5826 (Array Int Int)) (v_ArrVal_5836 (Array Int Int)) (v_ArrVal_5828 (Array Int Int)) (v_ArrVal_5838 (Array Int Int))) (not (= (mod (div (select (store (select (store (store (store (store (store (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5822) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5823) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt| (mod (+ (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4) (* 18446744056529682432 (mod (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) 2))) 18446744073709551616)) 18446744073709551616) v_ArrVal_5820)) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5838) |c_~#__CS_thread_lockedon~0.baseInt| v_ArrVal_5831) |c_~#mutex~0.baseInt| v_ArrVal_5836) |c_~#data~0.baseInt| v_ArrVal_5832) |c_~#__CS_thread_born_round~0.baseInt| v_ArrVal_5828) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5826) |c_~#__CS_thread_allocated~0.baseInt|) |c_~#__CS_thread_allocated~0.offsetInt| v_ArrVal_5825) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 1) 256) 1))) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 3)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 6)) (= 3 |c_~#__CS_thread_allocated~0.baseInt|) (= 6 |c_~#__CS_thread_lockedon~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 5)) (= 7 |c_~#mutex~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 2)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~j~2#1Int| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) (not (= 7 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt|))) is different from false [2022-01-10 19:13:25,261 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#__CS_thread_allocated~0.offsetInt| 0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt| 0) (= 4 |c_~#__CS_thread_born_round~0.baseInt|) (= |c_~#data~0.baseInt| 8) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 8)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~j~2#1Int| (+ (* (div |c_ULTIMATE.start_ULTIMATE.start_main_~j~2#1Int| 2147483648) 4294967296) 1)) (= (select (select |c_#memory_intInt| |c_~#__CS_thread_allocated~0.baseInt|) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt|) (= 5 |c_~#__CS_thread_status~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 4)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 1)) (forall ((v_ArrVal_5825 Int) (v_ArrVal_5831 (Array Int Int)) (v_ArrVal_5820 Int) (v_ArrVal_5822 (Array Int Int)) (v_ArrVal_5832 (Array Int Int)) (v_ArrVal_5823 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| Int) (v_ArrVal_5826 (Array Int Int)) (v_ArrVal_5836 (Array Int Int)) (v_ArrVal_5828 (Array Int Int)) (v_ArrVal_5838 (Array Int Int))) (not (= (mod (div (select (store (select (store (store (store (store (store (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5822) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt| (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| v_ArrVal_5823) |ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_data~0#1.offsetInt| (mod (+ (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4) (* 18446744056529682432 (mod (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) 2))) 18446744073709551616)) 18446744073709551616) v_ArrVal_5820)) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5838) |c_~#__CS_thread_lockedon~0.baseInt| v_ArrVal_5831) |c_~#mutex~0.baseInt| v_ArrVal_5836) |c_~#data~0.baseInt| v_ArrVal_5832) |c_~#__CS_thread_born_round~0.baseInt| v_ArrVal_5828) |c_~#__CS_thread_status~0.baseInt| v_ArrVal_5826) |c_~#__CS_thread_allocated~0.baseInt|) |c_~#__CS_thread_allocated~0.offsetInt| v_ArrVal_5825) (mod (+ |c_~#__CS_thread_allocated~0.offsetInt| 1) 18446744073709551616)) 1) 256) 1))) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 3)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 6)) (= 3 |c_~#__CS_thread_allocated~0.baseInt|) (= 6 |c_~#__CS_thread_lockedon~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 5)) (= 7 |c_~#mutex~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt| 2)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) (not (= 7 |c_ULTIMATE.start_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.baseInt|))) is different from false [2022-01-10 19:13:27,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 19:13:29,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 19:13:32,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 19:13:35,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 19:13:37,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []