/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 01:28:46,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 01:28:46,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 01:28:46,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 01:28:46,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 01:28:46,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 01:28:46,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 01:28:46,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 01:28:46,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 01:28:46,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 01:28:46,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 01:28:46,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 01:28:46,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 01:28:46,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 01:28:46,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 01:28:46,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 01:28:46,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 01:28:46,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 01:28:46,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 01:28:46,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 01:28:46,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 01:28:46,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 01:28:46,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 01:28:46,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 01:28:46,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 01:28:46,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 01:28:46,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 01:28:46,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 01:28:46,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 01:28:46,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 01:28:46,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 01:28:46,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 01:28:46,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 01:28:46,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 01:28:46,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 01:28:46,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 01:28:46,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 01:28:46,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 01:28:46,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 01:28:46,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 01:28:46,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 01:28:46,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 01:28:47,013 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 01:28:47,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 01:28:47,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 01:28:47,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 01:28:47,016 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 01:28:47,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 01:28:47,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 01:28:47,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 01:28:47,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 01:28:47,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 01:28:47,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 01:28:47,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 01:28:47,017 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 01:28:47,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 01:28:47,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 01:28:47,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 01:28:47,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 01:28:47,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:28:47,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 01:28:47,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 01:28:47,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 01:28:47,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 01:28:47,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 01:28:47,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 01:28:47,020 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 01:28:47,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-bitabs/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 [2021-01-07 01:28:47,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 01:28:47,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 01:28:47,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 01:28:47,465 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 01:28:47,466 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 01:28:47,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-01-07 01:28:47,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2980d5367/4b79b3edf7314cf6a221c080bc3d64a5/FLAG536200ed9 [2021-01-07 01:28:48,555 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 01:28:48,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-01-07 01:28:48,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2980d5367/4b79b3edf7314cf6a221c080bc3d64a5/FLAG536200ed9 [2021-01-07 01:28:48,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2980d5367/4b79b3edf7314cf6a221c080bc3d64a5 [2021-01-07 01:28:48,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 01:28:48,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 01:28:48,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 01:28:48,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 01:28:48,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 01:28:48,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:28:48" (1/1) ... [2021-01-07 01:28:48,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376e3294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:48, skipping insertion in model container [2021-01-07 01:28:48,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:28:48" (1/1) ... [2021-01-07 01:28:49,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 01:28:49,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 01:28:49,735 WARN L1219 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3460] [2021-01-07 01:28:49,736 WARN L1219 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3461-3462] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] [2021-01-07 01:28:49,958 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[104435,104448] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],raw_lock],ldv_1458],head_tail] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],magic] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],owner_cpu] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],owner] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],key] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],class_cache],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],class_cache],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],name] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],cpu] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],lock],dep_map],ip] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~__constr_expr_0~0,],count] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],wait_list],next] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~__constr_expr_0~0,],wait_list],prev] left hand side expression in assignment: address: IdentifierExpression[~sem,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~sz~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~signature~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~signature~0,],[BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~7,],IntegerLiteral[4294967296]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~argp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~old_ioctl~0,] left hand side expression in assignment: lhs: VariableLHS[~old_ioctl~0,] left hand side expression in assignment: lhs: VariableLHS[~rval~0,] left hand side expression in assignment: lhs: VariableLHS[~rval~0,] left hand side expression in assignment: lhs: VariableLHS[~adp~0,] left hand side expression in assignment: lhs: VariableLHS[~kioc~0,] left hand side expression in assignment: lhs: VariableLHS[~rval~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~kioc~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~0,] left hand side expression in assignment: lhs: VariableLHS[~rval~0,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~adapno~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: lhs: VariableLHS[~iterator~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~iterator~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~umimd~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~opcode~0,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~opcode~1,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~1,] left hand side expression in assignment: lhs: VariableLHS[~adapno~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~mbox64~0,] left hand side expression in assignment: lhs: VariableLHS[~mbox~0,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~mbox~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~mbox~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~pthru32~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~mbox~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~mbox~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pthru32~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[55],StructAccessExpression[IdentifierExpression[~pthru32~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~right_pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~pool~0,] left hand side expression in assignment: lhs: VariableLHS[~right_pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~pool~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~pool~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~pool~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~1,] left hand side expression in assignment: lhs: VariableLHS[~tp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__ret~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~__wait~0,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~__int~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~adp,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~iterator~1,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: lhs: VariableLHS[~adapno~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~iterator~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~kioc~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~opcode~2,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~2,] left hand side expression in assignment: lhs: VariableLHS[~hinfo~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~mbox64~1,] left hand side expression in assignment: lhs: VariableLHS[~upthru32~0,] left hand side expression in assignment: lhs: VariableLHS[~kpthru32~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[13],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[14],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[19],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~adapter~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[19],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[27],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[55],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[231],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[239],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: lhs: VariableLHS[~mbox_list~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~kioc~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[200],StructAccessExpression[IdentifierExpression[~kioc~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: lhs: VariableLHS[~adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~3,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~3,] left hand side expression in assignment: lhs: VariableLHS[~adapter~3,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~3,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~bufsize~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~pool~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~bufsize~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~4,] left hand side expression in assignment: lhs: VariableLHS[~adapter~4,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~adapter~4,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~kioc~4,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~pool~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~pool~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~lsi_fops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~lsi_fops_group2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_lock~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] [2021-01-07 01:28:50,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:28:50,630 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 01:28:50,726 WARN L1219 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3460] [2021-01-07 01:28:50,726 WARN L1219 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3461-3462] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] [2021-01-07 01:28:50,738 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[104435,104448] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~sem,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~sz~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#signature~0,],base],StructAccessExpression[IdentifierExpression[~#signature~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#signature~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#signature~0,],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~7,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~argp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~old_ioctl~0,] left hand side expression in assignment: lhs: VariableLHS[~old_ioctl~0,] left hand side expression in assignment: address: IdentifierExpression[~#rval~0,] left hand side expression in assignment: address: IdentifierExpression[~#rval~0,] left hand side expression in assignment: lhs: VariableLHS[~adp~0,] left hand side expression in assignment: lhs: VariableLHS[~kioc~0,] left hand side expression in assignment: address: IdentifierExpression[~#rval~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~kioc~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#rval~0,] left hand side expression in assignment: address: IdentifierExpression[~#rval~0,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~adapno~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: lhs: VariableLHS[~iterator~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~iterator~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~0,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~umimd~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~opcode~0,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~opcode~1,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~1,] left hand side expression in assignment: lhs: VariableLHS[~adapno~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~mbox64~0,] left hand side expression in assignment: lhs: VariableLHS[~mbox~0,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~mbox~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~mbox~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~pthru32~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~mbox~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~mbox~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pthru32~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[55],StructAccessExpression[IdentifierExpression[~pthru32~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~right_pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~pool~0,] left hand side expression in assignment: lhs: VariableLHS[~right_pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~pool~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~pool~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[240],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[256],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[257],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[184],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~pool~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~pool~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~1,] left hand side expression in assignment: lhs: VariableLHS[~tp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~tp~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__ret~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__wait~0,],base],StructAccessExpression[IdentifierExpression[~#__wait~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~__int~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~adp,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~iterator~1,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: lhs: VariableLHS[~adapno~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~iterator~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~adapter~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~kioc~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~kioc~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[258],StructAccessExpression[IdentifierExpression[~kioc~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~opcode~2,] left hand side expression in assignment: lhs: VariableLHS[~subopcode~2,] left hand side expression in assignment: lhs: VariableLHS[~hinfo~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~mbox64~1,] left hand side expression in assignment: lhs: VariableLHS[~upthru32~0,] left hand side expression in assignment: lhs: VariableLHS[~kpthru32~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[13],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[14],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cinfo,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[19],StructAccessExpression[IdentifierExpression[~cinfo,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~adapter~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[19],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[27],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[18],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[35],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[55],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[231],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~adapter~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[239],StructAccessExpression[IdentifierExpression[~adapter~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: lhs: VariableLHS[~mbox_list~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~kioc~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kioc~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[200],StructAccessExpression[IdentifierExpression[~kioc~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~rval~2,] left hand side expression in assignment: address: IdentifierExpression[~#adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~kioc~3,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~3,] left hand side expression in assignment: lhs: VariableLHS[~adapter~3,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~index~0,] left hand side expression in assignment: lhs: VariableLHS[~adapter~3,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~bufsize~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~pool~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~2,],base],StructAccessExpression[IdentifierExpression[~pool~2,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~bufsize~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~4,] left hand side expression in assignment: lhs: VariableLHS[~adapter~4,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: address: IdentifierExpression[~#adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~adapter~4,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~kioc~4,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~pool~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pool~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~pool~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~lsi_fops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~lsi_fops_group2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#adapters_count_g~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_lock~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_spin~0,GLOBAL] [2021-01-07 01:28:50,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:28:51,182 INFO L208 MainTranslator]: Completed translation [2021-01-07 01:28:51,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51 WrapperNode [2021-01-07 01:28:51,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 01:28:51,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 01:28:51,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 01:28:51,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 01:28:51,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (1/1) ... [2021-01-07 01:28:51,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (1/1) ... [2021-01-07 01:28:51,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 01:28:51,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 01:28:51,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 01:28:51,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 01:28:51,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (1/1) ... [2021-01-07 01:28:51,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (1/1) ... [2021-01-07 01:28:51,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (1/1) ... [2021-01-07 01:28:51,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (1/1) ... [2021-01-07 01:28:51,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (1/1) ... [2021-01-07 01:28:51,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (1/1) ... [2021-01-07 01:28:51,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (1/1) ... [2021-01-07 01:28:51,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 01:28:51,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 01:28:51,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 01:28:51,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 01:28:51,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:28:51,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-01-07 01:28:51,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-01-07 01:28:51,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-01-07 01:28:51,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 01:28:51,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 01:28:51,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 01:28:51,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 01:28:51,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 01:28:51,908 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 01:28:51,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 01:28:51,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 01:28:51,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 01:28:51,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 01:28:51,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-01-07 01:28:51,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 01:28:51,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 01:28:59,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 01:28:59,116 INFO L299 CfgBuilder]: Removed 1042 assume(true) statements. [2021-01-07 01:28:59,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:28:59 BoogieIcfgContainer [2021-01-07 01:28:59,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 01:28:59,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 01:28:59,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 01:28:59,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 01:28:59,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:28:48" (1/3) ... [2021-01-07 01:28:59,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e03494f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:28:59, skipping insertion in model container [2021-01-07 01:28:59,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:28:51" (2/3) ... [2021-01-07 01:28:59,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e03494f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:28:59, skipping insertion in model container [2021-01-07 01:28:59,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:28:59" (3/3) ... [2021-01-07 01:28:59,141 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_bitvector_linux-3.16-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-01-07 01:28:59,148 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 01:28:59,155 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-01-07 01:28:59,175 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-01-07 01:28:59,223 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 01:28:59,223 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 01:28:59,223 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 01:28:59,223 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 01:28:59,224 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 01:28:59,224 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 01:28:59,224 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 01:28:59,224 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 01:28:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states. [2021-01-07 01:28:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-07 01:28:59,282 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:28:59,283 INFO L422 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] [2021-01-07 01:28:59,284 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:28:59,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:28:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1385985514, now seen corresponding path program 1 times [2021-01-07 01:28:59,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:28:59,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059190257] [2021-01-07 01:28:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:28:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:28:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:28:59,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059190257] [2021-01-07 01:28:59,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:28:59,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:28:59,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555666273] [2021-01-07 01:28:59,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 01:28:59,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:28:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 01:28:59,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:28:59,843 INFO L87 Difference]: Start difference. First operand 835 states. Second operand 2 states. [2021-01-07 01:28:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:28:59,960 INFO L93 Difference]: Finished difference Result 1667 states and 2311 transitions. [2021-01-07 01:28:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 01:28:59,964 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 62 [2021-01-07 01:28:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:28:59,992 INFO L225 Difference]: With dead ends: 1667 [2021-01-07 01:28:59,992 INFO L226 Difference]: Without dead ends: 823 [2021-01-07 01:29:00,001 INFO L677 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 [2021-01-07 01:29:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2021-01-07 01:29:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 823. [2021-01-07 01:29:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2021-01-07 01:29:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1122 transitions. [2021-01-07 01:29:00,104 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1122 transitions. Word has length 62 [2021-01-07 01:29:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:00,105 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 1122 transitions. [2021-01-07 01:29:00,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 01:29:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1122 transitions. [2021-01-07 01:29:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-07 01:29:00,110 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:00,111 INFO L422 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] [2021-01-07 01:29:00,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 01:29:00,111 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:00,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:00,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1732742655, now seen corresponding path program 1 times [2021-01-07 01:29:00,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:00,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513189922] [2021-01-07 01:29:00,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:29:00,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513189922] [2021-01-07 01:29:00,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:29:00,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:29:00,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485113990] [2021-01-07 01:29:00,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:29:00,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:29:00,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:29:00,388 INFO L87 Difference]: Start difference. First operand 823 states and 1122 transitions. Second operand 3 states. [2021-01-07 01:29:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:00,581 INFO L93 Difference]: Finished difference Result 1664 states and 2273 transitions. [2021-01-07 01:29:00,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:29:00,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-07 01:29:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:00,592 INFO L225 Difference]: With dead ends: 1664 [2021-01-07 01:29:00,592 INFO L226 Difference]: Without dead ends: 844 [2021-01-07 01:29:00,597 INFO L677 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 [2021-01-07 01:29:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-01-07 01:29:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 841. [2021-01-07 01:29:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2021-01-07 01:29:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1149 transitions. [2021-01-07 01:29:00,650 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1149 transitions. Word has length 63 [2021-01-07 01:29:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:00,650 INFO L481 AbstractCegarLoop]: Abstraction has 841 states and 1149 transitions. [2021-01-07 01:29:00,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:29:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1149 transitions. [2021-01-07 01:29:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-07 01:29:00,662 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:00,663 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:00,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 01:29:00,666 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:00,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2128587854, now seen corresponding path program 1 times [2021-01-07 01:29:00,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:00,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560617773] [2021-01-07 01:29:00,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:29:01,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560617773] [2021-01-07 01:29:01,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:29:01,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 01:29:01,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120816312] [2021-01-07 01:29:01,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:29:01,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:01,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:29:01,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:29:01,016 INFO L87 Difference]: Start difference. First operand 841 states and 1149 transitions. Second operand 6 states. [2021-01-07 01:29:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:01,709 INFO L93 Difference]: Finished difference Result 1769 states and 2432 transitions. [2021-01-07 01:29:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 01:29:01,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2021-01-07 01:29:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:01,718 INFO L225 Difference]: With dead ends: 1769 [2021-01-07 01:29:01,719 INFO L226 Difference]: Without dead ends: 931 [2021-01-07 01:29:01,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:29:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-01-07 01:29:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 901. [2021-01-07 01:29:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2021-01-07 01:29:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1239 transitions. [2021-01-07 01:29:01,762 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1239 transitions. Word has length 85 [2021-01-07 01:29:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:01,763 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1239 transitions. [2021-01-07 01:29:01,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:29:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1239 transitions. [2021-01-07 01:29:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-07 01:29:01,765 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:01,766 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:01,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 01:29:01,766 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash 368041951, now seen corresponding path program 1 times [2021-01-07 01:29:01,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:01,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723210186] [2021-01-07 01:29:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:29:01,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723210186] [2021-01-07 01:29:01,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:29:01,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:29:01,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585495778] [2021-01-07 01:29:01,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:29:01,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:01,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:29:01,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:29:01,903 INFO L87 Difference]: Start difference. First operand 901 states and 1239 transitions. Second operand 3 states. [2021-01-07 01:29:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:02,010 INFO L93 Difference]: Finished difference Result 2695 states and 3708 transitions. [2021-01-07 01:29:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:29:02,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-07 01:29:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:02,022 INFO L225 Difference]: With dead ends: 2695 [2021-01-07 01:29:02,022 INFO L226 Difference]: Without dead ends: 1797 [2021-01-07 01:29:02,029 INFO L677 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 [2021-01-07 01:29:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2021-01-07 01:29:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 902. [2021-01-07 01:29:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2021-01-07 01:29:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1240 transitions. [2021-01-07 01:29:02,171 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1240 transitions. Word has length 99 [2021-01-07 01:29:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:02,172 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1240 transitions. [2021-01-07 01:29:02,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:29:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1240 transitions. [2021-01-07 01:29:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-07 01:29:02,180 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:02,181 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:02,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 01:29:02,181 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash -49354655, now seen corresponding path program 1 times [2021-01-07 01:29:02,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:02,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462984448] [2021-01-07 01:29:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:02,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462984448] [2021-01-07 01:29:02,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:29:02,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:29:02,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602647245] [2021-01-07 01:29:02,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:29:02,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:02,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:29:02,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:29:02,400 INFO L87 Difference]: Start difference. First operand 902 states and 1240 transitions. Second operand 4 states. [2021-01-07 01:29:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:02,594 INFO L93 Difference]: Finished difference Result 1986 states and 2748 transitions. [2021-01-07 01:29:02,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:29:02,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2021-01-07 01:29:02,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:02,604 INFO L225 Difference]: With dead ends: 1986 [2021-01-07 01:29:02,605 INFO L226 Difference]: Without dead ends: 1087 [2021-01-07 01:29:02,608 INFO L677 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 [2021-01-07 01:29:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2021-01-07 01:29:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 906. [2021-01-07 01:29:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2021-01-07 01:29:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1244 transitions. [2021-01-07 01:29:02,678 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1244 transitions. Word has length 99 [2021-01-07 01:29:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:02,679 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1244 transitions. [2021-01-07 01:29:02,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:29:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1244 transitions. [2021-01-07 01:29:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-07 01:29:02,683 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:02,683 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:02,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 01:29:02,684 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash 899028749, now seen corresponding path program 1 times [2021-01-07 01:29:02,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:02,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567331454] [2021-01-07 01:29:02,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:03,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567331454] [2021-01-07 01:29:03,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:29:03,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:29:03,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709989955] [2021-01-07 01:29:03,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:29:03,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:03,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:29:03,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:29:03,062 INFO L87 Difference]: Start difference. First operand 906 states and 1244 transitions. Second operand 3 states. [2021-01-07 01:29:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:03,168 INFO L93 Difference]: Finished difference Result 1809 states and 2485 transitions. [2021-01-07 01:29:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:29:03,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-07 01:29:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:03,176 INFO L225 Difference]: With dead ends: 1809 [2021-01-07 01:29:03,176 INFO L226 Difference]: Without dead ends: 906 [2021-01-07 01:29:03,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:29:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-01-07 01:29:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2021-01-07 01:29:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2021-01-07 01:29:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1230 transitions. [2021-01-07 01:29:03,251 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1230 transitions. Word has length 107 [2021-01-07 01:29:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:03,253 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1230 transitions. [2021-01-07 01:29:03,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:29:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1230 transitions. [2021-01-07 01:29:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-07 01:29:03,256 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:03,256 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:03,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 01:29:03,256 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:03,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1716677199, now seen corresponding path program 1 times [2021-01-07 01:29:03,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:03,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597316688] [2021-01-07 01:29:03,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:03,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597316688] [2021-01-07 01:29:03,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:29:03,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:29:03,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822444614] [2021-01-07 01:29:03,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:29:03,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:03,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:29:03,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:29:03,566 INFO L87 Difference]: Start difference. First operand 906 states and 1230 transitions. Second operand 3 states. [2021-01-07 01:29:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:03,661 INFO L93 Difference]: Finished difference Result 1811 states and 2461 transitions. [2021-01-07 01:29:03,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:29:03,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-07 01:29:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:03,669 INFO L225 Difference]: With dead ends: 1811 [2021-01-07 01:29:03,669 INFO L226 Difference]: Without dead ends: 908 [2021-01-07 01:29:03,674 INFO L677 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 [2021-01-07 01:29:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-01-07 01:29:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2021-01-07 01:29:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2021-01-07 01:29:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1232 transitions. [2021-01-07 01:29:03,734 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1232 transitions. Word has length 107 [2021-01-07 01:29:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:03,736 INFO L481 AbstractCegarLoop]: Abstraction has 908 states and 1232 transitions. [2021-01-07 01:29:03,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:29:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1232 transitions. [2021-01-07 01:29:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-07 01:29:03,738 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:03,738 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:03,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 01:29:03,739 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1323650189, now seen corresponding path program 1 times [2021-01-07 01:29:03,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:03,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098986064] [2021-01-07 01:29:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:03,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098986064] [2021-01-07 01:29:03,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:29:03,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:29:03,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723991571] [2021-01-07 01:29:03,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:29:03,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:03,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:29:03,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:29:03,927 INFO L87 Difference]: Start difference. First operand 908 states and 1232 transitions. Second operand 3 states. [2021-01-07 01:29:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:04,398 INFO L93 Difference]: Finished difference Result 2628 states and 3582 transitions. [2021-01-07 01:29:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:29:04,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-07 01:29:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:04,409 INFO L225 Difference]: With dead ends: 2628 [2021-01-07 01:29:04,410 INFO L226 Difference]: Without dead ends: 1723 [2021-01-07 01:29:04,412 INFO L677 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 [2021-01-07 01:29:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2021-01-07 01:29:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 914. [2021-01-07 01:29:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2021-01-07 01:29:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1238 transitions. [2021-01-07 01:29:04,478 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1238 transitions. Word has length 107 [2021-01-07 01:29:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:04,479 INFO L481 AbstractCegarLoop]: Abstraction has 914 states and 1238 transitions. [2021-01-07 01:29:04,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:29:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1238 transitions. [2021-01-07 01:29:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-07 01:29:04,482 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:04,482 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:04,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 01:29:04,482 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash 600820308, now seen corresponding path program 1 times [2021-01-07 01:29:04,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:04,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628641430] [2021-01-07 01:29:04,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:04,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628641430] [2021-01-07 01:29:04,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346766344] [2021-01-07 01:29:04,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:05,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 01:29:05,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:29:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-07 01:29:05,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:29:05,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-07 01:29:05,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5805067] [2021-01-07 01:29:05,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:29:05,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:05,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:29:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:29:05,508 INFO L87 Difference]: Start difference. First operand 914 states and 1238 transitions. Second operand 3 states. [2021-01-07 01:29:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:05,788 INFO L93 Difference]: Finished difference Result 2610 states and 3564 transitions. [2021-01-07 01:29:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:29:05,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2021-01-07 01:29:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:05,798 INFO L225 Difference]: With dead ends: 2610 [2021-01-07 01:29:05,799 INFO L226 Difference]: Without dead ends: 1699 [2021-01-07 01:29:05,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:29:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2021-01-07 01:29:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 950. [2021-01-07 01:29:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2021-01-07 01:29:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1286 transitions. [2021-01-07 01:29:05,877 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1286 transitions. Word has length 111 [2021-01-07 01:29:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:05,880 INFO L481 AbstractCegarLoop]: Abstraction has 950 states and 1286 transitions. [2021-01-07 01:29:05,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:29:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1286 transitions. [2021-01-07 01:29:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-07 01:29:05,883 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:05,885 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:06,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-07 01:29:06,101 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:06,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:06,102 INFO L82 PathProgramCache]: Analyzing trace with hash -839010496, now seen corresponding path program 1 times [2021-01-07 01:29:06,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:06,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934897549] [2021-01-07 01:29:06,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:06,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934897549] [2021-01-07 01:29:06,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490816641] [2021-01-07 01:29:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:07,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 1672 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 01:29:07,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:29:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 01:29:07,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:29:07,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-01-07 01:29:07,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309681457] [2021-01-07 01:29:07,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:29:07,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:07,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:29:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:29:07,296 INFO L87 Difference]: Start difference. First operand 950 states and 1286 transitions. Second operand 5 states. [2021-01-07 01:29:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:07,707 INFO L93 Difference]: Finished difference Result 1900 states and 2573 transitions. [2021-01-07 01:29:07,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:29:07,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2021-01-07 01:29:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:07,713 INFO L225 Difference]: With dead ends: 1900 [2021-01-07 01:29:07,714 INFO L226 Difference]: Without dead ends: 948 [2021-01-07 01:29:07,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:29:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2021-01-07 01:29:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2021-01-07 01:29:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2021-01-07 01:29:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1283 transitions. [2021-01-07 01:29:07,830 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1283 transitions. Word has length 116 [2021-01-07 01:29:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:07,831 INFO L481 AbstractCegarLoop]: Abstraction has 948 states and 1283 transitions. [2021-01-07 01:29:07,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:29:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1283 transitions. [2021-01-07 01:29:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-07 01:29:07,833 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:07,834 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:08,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 01:29:08,047 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1898073031, now seen corresponding path program 1 times [2021-01-07 01:29:08,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:08,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032726026] [2021-01-07 01:29:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:08,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032726026] [2021-01-07 01:29:08,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702270749] [2021-01-07 01:29:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:08,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 1707 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 01:29:08,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:29:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:09,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:29:09,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-07 01:29:09,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951919955] [2021-01-07 01:29:09,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:29:09,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:29:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:29:09,099 INFO L87 Difference]: Start difference. First operand 948 states and 1283 transitions. Second operand 5 states. [2021-01-07 01:29:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:09,994 INFO L93 Difference]: Finished difference Result 3549 states and 4829 transitions. [2021-01-07 01:29:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:29:09,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2021-01-07 01:29:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:10,010 INFO L225 Difference]: With dead ends: 3549 [2021-01-07 01:29:10,011 INFO L226 Difference]: Without dead ends: 2604 [2021-01-07 01:29:10,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:29:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2021-01-07 01:29:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1014. [2021-01-07 01:29:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2021-01-07 01:29:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1361 transitions. [2021-01-07 01:29:10,112 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1361 transitions. Word has length 116 [2021-01-07 01:29:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:10,113 INFO L481 AbstractCegarLoop]: Abstraction has 1014 states and 1361 transitions. [2021-01-07 01:29:10,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:29:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1361 transitions. [2021-01-07 01:29:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-07 01:29:10,116 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:10,116 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:10,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-07 01:29:10,332 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1070580320, now seen corresponding path program 1 times [2021-01-07 01:29:10,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:10,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238570577] [2021-01-07 01:29:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-07 01:29:10,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238570577] [2021-01-07 01:29:10,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:29:10,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:29:10,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497614321] [2021-01-07 01:29:10,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:29:10,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:29:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:29:10,521 INFO L87 Difference]: Start difference. First operand 1014 states and 1361 transitions. Second operand 4 states. [2021-01-07 01:29:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:10,740 INFO L93 Difference]: Finished difference Result 2208 states and 2979 transitions. [2021-01-07 01:29:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:29:10,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2021-01-07 01:29:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:10,747 INFO L225 Difference]: With dead ends: 2208 [2021-01-07 01:29:10,747 INFO L226 Difference]: Without dead ends: 1197 [2021-01-07 01:29:10,749 INFO L677 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 [2021-01-07 01:29:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2021-01-07 01:29:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1014. [2021-01-07 01:29:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2021-01-07 01:29:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1361 transitions. [2021-01-07 01:29:10,840 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1361 transitions. Word has length 120 [2021-01-07 01:29:10,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:10,840 INFO L481 AbstractCegarLoop]: Abstraction has 1014 states and 1361 transitions. [2021-01-07 01:29:10,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:29:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1361 transitions. [2021-01-07 01:29:10,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-07 01:29:10,843 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:10,843 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:10,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 01:29:10,844 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:10,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:10,844 INFO L82 PathProgramCache]: Analyzing trace with hash 719046718, now seen corresponding path program 1 times [2021-01-07 01:29:10,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:10,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383654774] [2021-01-07 01:29:10,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:11,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383654774] [2021-01-07 01:29:11,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075229473] [2021-01-07 01:29:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:11,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 1723 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 01:29:11,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:29:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:11,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:29:11,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 01:29:11,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409969399] [2021-01-07 01:29:11,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:29:11,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:11,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:29:11,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:29:11,930 INFO L87 Difference]: Start difference. First operand 1014 states and 1361 transitions. Second operand 6 states. [2021-01-07 01:29:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:13,037 INFO L93 Difference]: Finished difference Result 4458 states and 6055 transitions. [2021-01-07 01:29:13,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:29:13,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2021-01-07 01:29:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:13,056 INFO L225 Difference]: With dead ends: 4458 [2021-01-07 01:29:13,056 INFO L226 Difference]: Without dead ends: 3447 [2021-01-07 01:29:13,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:29:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2021-01-07 01:29:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 1098. [2021-01-07 01:29:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2021-01-07 01:29:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1469 transitions. [2021-01-07 01:29:13,175 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1469 transitions. Word has length 121 [2021-01-07 01:29:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:13,175 INFO L481 AbstractCegarLoop]: Abstraction has 1098 states and 1469 transitions. [2021-01-07 01:29:13,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:29:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1469 transitions. [2021-01-07 01:29:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-01-07 01:29:13,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:13,179 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:13,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:13,395 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:13,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1324886871, now seen corresponding path program 2 times [2021-01-07 01:29:13,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:13,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327656279] [2021-01-07 01:29:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:29:13,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327656279] [2021-01-07 01:29:13,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349031818] [2021-01-07 01:29:13,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:14,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 01:29:14,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:29:14,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 01:29:14,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:29:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-01-07 01:29:14,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:29:14,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-01-07 01:29:14,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204273279] [2021-01-07 01:29:14,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:29:14,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:29:14,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:29:14,690 INFO L87 Difference]: Start difference. First operand 1098 states and 1469 transitions. Second operand 3 states. [2021-01-07 01:29:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:14,830 INFO L93 Difference]: Finished difference Result 2197 states and 2941 transitions. [2021-01-07 01:29:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:29:14,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2021-01-07 01:29:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:14,837 INFO L225 Difference]: With dead ends: 2197 [2021-01-07 01:29:14,837 INFO L226 Difference]: Without dead ends: 1102 [2021-01-07 01:29:14,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:29:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2021-01-07 01:29:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2021-01-07 01:29:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2021-01-07 01:29:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1473 transitions. [2021-01-07 01:29:14,968 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1473 transitions. Word has length 125 [2021-01-07 01:29:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:14,968 INFO L481 AbstractCegarLoop]: Abstraction has 1102 states and 1473 transitions. [2021-01-07 01:29:14,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:29:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1473 transitions. [2021-01-07 01:29:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-07 01:29:14,972 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:14,973 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:15,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 01:29:15,187 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:15,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash 935585522, now seen corresponding path program 1 times [2021-01-07 01:29:15,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:15,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965430469] [2021-01-07 01:29:15,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 01:29:15,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965430469] [2021-01-07 01:29:15,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799656150] [2021-01-07 01:29:15,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:16,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 1740 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 01:29:16,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:29:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 01:29:16,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:29:16,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-07 01:29:16,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158828144] [2021-01-07 01:29:16,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 01:29:16,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:16,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 01:29:16,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:29:16,196 INFO L87 Difference]: Start difference. First operand 1102 states and 1473 transitions. Second operand 7 states. [2021-01-07 01:29:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:17,651 INFO L93 Difference]: Finished difference Result 5409 states and 7335 transitions. [2021-01-07 01:29:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:29:17,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2021-01-07 01:29:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:17,677 INFO L225 Difference]: With dead ends: 5409 [2021-01-07 01:29:17,678 INFO L226 Difference]: Without dead ends: 4310 [2021-01-07 01:29:17,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:29:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2021-01-07 01:29:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 1186. [2021-01-07 01:29:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2021-01-07 01:29:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1581 transitions. [2021-01-07 01:29:17,813 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1581 transitions. Word has length 127 [2021-01-07 01:29:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:17,813 INFO L481 AbstractCegarLoop]: Abstraction has 1186 states and 1581 transitions. [2021-01-07 01:29:17,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 01:29:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1581 transitions. [2021-01-07 01:29:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-07 01:29:17,817 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:17,817 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:18,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:18,033 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1485426699, now seen corresponding path program 2 times [2021-01-07 01:29:18,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:18,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619068258] [2021-01-07 01:29:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 01:29:18,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619068258] [2021-01-07 01:29:18,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150113250] [2021-01-07 01:29:18,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:19,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 01:29:19,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:29:19,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 01:29:19,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:29:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-01-07 01:29:19,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:29:19,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-01-07 01:29:19,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244456113] [2021-01-07 01:29:19,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:29:19,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:19,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:29:19,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:29:19,430 INFO L87 Difference]: Start difference. First operand 1186 states and 1581 transitions. Second operand 3 states. [2021-01-07 01:29:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:19,622 INFO L93 Difference]: Finished difference Result 2514 states and 3367 transitions. [2021-01-07 01:29:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:29:19,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2021-01-07 01:29:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:19,631 INFO L225 Difference]: With dead ends: 2514 [2021-01-07 01:29:19,631 INFO L226 Difference]: Without dead ends: 1331 [2021-01-07 01:29:19,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:29:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2021-01-07 01:29:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1188. [2021-01-07 01:29:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2021-01-07 01:29:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1583 transitions. [2021-01-07 01:29:19,754 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1583 transitions. Word has length 131 [2021-01-07 01:29:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:19,754 INFO L481 AbstractCegarLoop]: Abstraction has 1188 states and 1583 transitions. [2021-01-07 01:29:19,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:29:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1583 transitions. [2021-01-07 01:29:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-07 01:29:19,758 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:19,758 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:19,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-07 01:29:19,972 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:19,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:19,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1562327497, now seen corresponding path program 1 times [2021-01-07 01:29:19,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:19,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437164888] [2021-01-07 01:29:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 01:29:20,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437164888] [2021-01-07 01:29:20,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258553173] [2021-01-07 01:29:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:20,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 01:29:20,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:29:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 01:29:20,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:29:20,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-01-07 01:29:20,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980607050] [2021-01-07 01:29:20,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:29:20,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:20,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:29:20,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:29:20,939 INFO L87 Difference]: Start difference. First operand 1188 states and 1583 transitions. Second operand 8 states. [2021-01-07 01:29:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:22,286 INFO L93 Difference]: Finished difference Result 6270 states and 8501 transitions. [2021-01-07 01:29:22,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 01:29:22,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 131 [2021-01-07 01:29:22,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:22,320 INFO L225 Difference]: With dead ends: 6270 [2021-01-07 01:29:22,320 INFO L226 Difference]: Without dead ends: 5085 [2021-01-07 01:29:22,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:29:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2021-01-07 01:29:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 1272. [2021-01-07 01:29:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2021-01-07 01:29:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1691 transitions. [2021-01-07 01:29:22,485 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1691 transitions. Word has length 131 [2021-01-07 01:29:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:22,485 INFO L481 AbstractCegarLoop]: Abstraction has 1272 states and 1691 transitions. [2021-01-07 01:29:22,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:29:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1691 transitions. [2021-01-07 01:29:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-07 01:29:22,492 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:22,493 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:22,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 01:29:22,707 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:22,708 INFO L82 PathProgramCache]: Analyzing trace with hash -406724766, now seen corresponding path program 2 times [2021-01-07 01:29:22,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:22,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603403161] [2021-01-07 01:29:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-01-07 01:29:22,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603403161] [2021-01-07 01:29:22,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437006851] [2021-01-07 01:29:22,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:23,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 01:29:23,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:29:23,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 01:29:23,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:29:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-01-07 01:29:24,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:29:24,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-01-07 01:29:24,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536519853] [2021-01-07 01:29:24,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:29:24,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:24,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:29:24,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:29:24,034 INFO L87 Difference]: Start difference. First operand 1272 states and 1691 transitions. Second operand 4 states. [2021-01-07 01:29:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:24,354 INFO L93 Difference]: Finished difference Result 2957 states and 3965 transitions. [2021-01-07 01:29:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:29:24,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2021-01-07 01:29:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:24,360 INFO L225 Difference]: With dead ends: 2957 [2021-01-07 01:29:24,360 INFO L226 Difference]: Without dead ends: 1688 [2021-01-07 01:29:24,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:29:24,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2021-01-07 01:29:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1276. [2021-01-07 01:29:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2021-01-07 01:29:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1695 transitions. [2021-01-07 01:29:24,506 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1695 transitions. Word has length 135 [2021-01-07 01:29:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:24,506 INFO L481 AbstractCegarLoop]: Abstraction has 1276 states and 1695 transitions. [2021-01-07 01:29:24,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:29:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1695 transitions. [2021-01-07 01:29:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-07 01:29:24,510 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:24,510 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:24,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 01:29:24,724 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1721218688, now seen corresponding path program 1 times [2021-01-07 01:29:24,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:24,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167957486] [2021-01-07 01:29:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-01-07 01:29:24,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167957486] [2021-01-07 01:29:24,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189576698] [2021-01-07 01:29:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:26,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 1775 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 01:29:26,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:29:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-01-07 01:29:26,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:29:26,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-07 01:29:26,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341926657] [2021-01-07 01:29:26,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:29:26,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:29:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:29:26,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:29:26,927 INFO L87 Difference]: Start difference. First operand 1276 states and 1695 transitions. Second operand 5 states. [2021-01-07 01:29:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:29:27,055 INFO L93 Difference]: Finished difference Result 2553 states and 3393 transitions. [2021-01-07 01:29:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:29:27,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2021-01-07 01:29:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:29:27,059 INFO L225 Difference]: With dead ends: 2553 [2021-01-07 01:29:27,059 INFO L226 Difference]: Without dead ends: 1280 [2021-01-07 01:29:27,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:29:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2021-01-07 01:29:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1280. [2021-01-07 01:29:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2021-01-07 01:29:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1699 transitions. [2021-01-07 01:29:27,238 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1699 transitions. Word has length 138 [2021-01-07 01:29:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:29:27,239 INFO L481 AbstractCegarLoop]: Abstraction has 1280 states and 1699 transitions. [2021-01-07 01:29:27,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:29:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1699 transitions. [2021-01-07 01:29:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 01:29:27,242 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:29:27,243 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:29:27,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:29:27,457 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:29:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:29:27,459 INFO L82 PathProgramCache]: Analyzing trace with hash 591195845, now seen corresponding path program 2 times [2021-01-07 01:29:27,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:29:27,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663588801] [2021-01-07 01:29:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:29:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:29:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-01-07 01:29:27,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663588801] [2021-01-07 01:29:27,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806077373] [2021-01-07 01:29:27,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:30:17,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 01:30:17,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:30:17,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 1782 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 01:30:17,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:30:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-01-07 01:30:17,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:30:17,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 01:30:17,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036627715] [2021-01-07 01:30:17,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:30:17,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:30:17,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:30:17,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:30:17,293 INFO L87 Difference]: Start difference. First operand 1280 states and 1699 transitions. Second operand 6 states. [2021-01-07 01:30:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:30:17,473 INFO L93 Difference]: Finished difference Result 2561 states and 3401 transitions. [2021-01-07 01:30:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:30:17,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2021-01-07 01:30:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:30:17,477 INFO L225 Difference]: With dead ends: 2561 [2021-01-07 01:30:17,477 INFO L226 Difference]: Without dead ends: 1284 [2021-01-07 01:30:17,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:30:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2021-01-07 01:30:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2021-01-07 01:30:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2021-01-07 01:30:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1703 transitions. [2021-01-07 01:30:17,624 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1703 transitions. Word has length 140 [2021-01-07 01:30:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:30:17,625 INFO L481 AbstractCegarLoop]: Abstraction has 1284 states and 1703 transitions. [2021-01-07 01:30:17,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:30:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1703 transitions. [2021-01-07 01:30:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-01-07 01:30:17,629 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:30:17,629 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:30:17,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:30:17,843 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:30:17,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:30:17,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1265969610, now seen corresponding path program 3 times [2021-01-07 01:30:17,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:30:17,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83777081] [2021-01-07 01:30:17,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:30:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:30:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-01-07 01:30:18,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83777081] [2021-01-07 01:30:18,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738084120] [2021-01-07 01:30:18,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true